./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3289d67d 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_FNV_nondet_test2-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-17 02:45:51,036 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-17 02:45:51,108 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-17 02:45:51,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-17 02:45:51,115 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-17 02:45:51,154 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-17 02:45:51,155 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-17 02:45:51,155 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-17 02:45:51,156 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-17 02:45:51,158 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-17 02:45:51,158 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-17 02:45:51,158 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-17 02:45:51,159 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-17 02:45:51,161 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-17 02:45:51,161 INFO L153 SettingsManager]: * Use SBE=true [2024-11-17 02:45:51,174 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-17 02:45:51,176 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-17 02:45:51,177 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-17 02:45:51,177 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-17 02:45:51,177 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-17 02:45:51,178 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-17 02:45:51,180 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-17 02:45:51,181 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-17 02:45:51,181 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-17 02:45:51,181 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-17 02:45:51,181 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-17 02:45:51,182 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-17 02:45:51,182 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-17 02:45:51,182 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-17 02:45:51,182 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-17 02:45:51,183 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-17 02:45:51,183 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-17 02:45:51,183 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-17 02:45:51,183 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 02:45:51,184 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-17 02:45:51,184 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-17 02:45:51,184 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-17 02:45:51,184 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-17 02:45:51,185 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-17 02:45:51,185 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-17 02:45:51,186 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-17 02:45:51,187 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-17 02:45:51,187 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 -> e277983cfe4b30513b023d34f2b840358d8a25fd7a5c39241cadd105379bfb92 [2024-11-17 02:45:51,452 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-17 02:45:51,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-17 02:45:51,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-17 02:45:51,482 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-17 02:45:51,482 INFO L274 PluginConnector]: CDTParser initialized [2024-11-17 02:45:51,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-1.i [2024-11-17 02:45:52,974 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-17 02:45:53,268 INFO L384 CDTParser]: Found 1 translation units. [2024-11-17 02:45:53,270 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test2-1.i [2024-11-17 02:45:53,291 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b737b5f90/3760faab214d4ef187c69b5c8155631f/FLAG56f28ecfa [2024-11-17 02:45:53,304 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b737b5f90/3760faab214d4ef187c69b5c8155631f [2024-11-17 02:45:53,307 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-17 02:45:53,308 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-17 02:45:53,309 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-17 02:45:53,309 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-17 02:45:53,314 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-17 02:45:53,315 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:45:53" (1/1) ... [2024-11-17 02:45:53,316 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@428137e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:45:53, skipping insertion in model container [2024-11-17 02:45:53,316 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.11 02:45:53" (1/1) ... [2024-11-17 02:45:53,369 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-17 02:45:53,810 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-17 02:45:53,859 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-17 02:45:53,865 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-17 02:45:53,871 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-17 02:45:53,886 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-17 02:45:53,922 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-17 02:45:53,923 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-17 02:45:53,925 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-17 02:45:53,925 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-17 02:45:53,936 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:45:53,950 INFO L200 MainTranslator]: Completed pre-run [2024-11-17 02:45:54,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-17 02:45:54,113 INFO L204 MainTranslator]: Completed translation [2024-11-17 02:45:54,113 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:45:54 WrapperNode [2024-11-17 02:45:54,113 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-17 02:45:54,115 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-17 02:45:54,115 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-17 02:45:54,115 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-17 02:45:54,122 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:45:54" (1/1) ... [2024-11-17 02:45:54,170 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:45:54" (1/1) ... [2024-11-17 02:45:54,236 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1259 [2024-11-17 02:45:54,237 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-17 02:45:54,237 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-17 02:45:54,237 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-17 02:45:54,238 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-17 02:45:54,252 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:45:54" (1/1) ... [2024-11-17 02:45:54,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:45:54" (1/1) ... [2024-11-17 02:45:54,274 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:45:54" (1/1) ... [2024-11-17 02:45:54,353 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 170, 34]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 42, 4]. [2024-11-17 02:45:54,353 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:45:54" (1/1) ... [2024-11-17 02:45:54,353 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:45:54" (1/1) ... [2024-11-17 02:45:54,404 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:45:54" (1/1) ... [2024-11-17 02:45:54,407 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:45:54" (1/1) ... [2024-11-17 02:45:54,416 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:45:54" (1/1) ... [2024-11-17 02:45:54,423 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:45:54" (1/1) ... [2024-11-17 02:45:54,438 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-17 02:45:54,440 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-17 02:45:54,440 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-17 02:45:54,441 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-17 02:45:54,441 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:45:54" (1/1) ... [2024-11-17 02:45:54,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-17 02:45:54,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:45:54,480 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-17 02:45:54,483 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-17 02:45:54,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-17 02:45:54,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-17 02:45:54,532 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-17 02:45:54,532 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-17 02:45:54,533 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-17 02:45:54,533 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-17 02:45:54,533 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-17 02:45:54,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-17 02:45:54,533 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-17 02:45:54,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-17 02:45:54,534 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-17 02:45:54,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-17 02:45:54,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-17 02:45:54,534 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-17 02:45:54,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-17 02:45:54,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-17 02:45:54,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-17 02:45:54,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-17 02:45:54,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-17 02:45:54,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-17 02:45:54,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-17 02:45:54,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-17 02:45:54,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-17 02:45:54,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-17 02:45:54,536 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-17 02:45:54,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-17 02:45:54,536 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-17 02:45:54,729 INFO L256 CfgBuilder]: Building ICFG [2024-11-17 02:45:54,732 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-17 02:45:56,569 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L812: call ULTIMATE.dealloc(main_~#i~0#1.base, main_~#i~0#1.offset);havoc main_~#i~0#1.base, main_~#i~0#1.offset; [2024-11-17 02:45:56,705 INFO L? ?]: Removed 1028 outVars from TransFormulas that were not future-live. [2024-11-17 02:45:56,705 INFO L307 CfgBuilder]: Performing block encoding [2024-11-17 02:45:56,785 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-17 02:45:56,786 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-17 02:45:56,786 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 02:45:56 BoogieIcfgContainer [2024-11-17 02:45:56,786 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-17 02:45:56,789 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-17 02:45:56,789 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-17 02:45:56,792 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-17 02:45:56,793 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.11 02:45:53" (1/3) ... [2024-11-17 02:45:56,793 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@656904cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:45:56, skipping insertion in model container [2024-11-17 02:45:56,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.11 02:45:54" (2/3) ... [2024-11-17 02:45:56,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@656904cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.11 02:45:56, skipping insertion in model container [2024-11-17 02:45:56,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.11 02:45:56" (3/3) ... [2024-11-17 02:45:56,797 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test2-1.i [2024-11-17 02:45:56,813 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-17 02:45:56,813 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 420 error locations. [2024-11-17 02:45:56,887 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-17 02:45:56,894 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;@258a70b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-17 02:45:56,894 INFO L334 AbstractCegarLoop]: Starting to check reachability of 420 error locations. [2024-11-17 02:45:56,902 INFO L276 IsEmpty]: Start isEmpty. Operand has 1073 states, 651 states have (on average 1.9831029185867897) internal successors, (1291), 1068 states have internal predecessors, (1291), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:45:56,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-17 02:45:56,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:45:56,909 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-17 02:45:56,909 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr418REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:45:56,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:45:56,914 INFO L85 PathProgramCache]: Analyzing trace with hash 42419324, now seen corresponding path program 1 times [2024-11-17 02:45:56,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:45:56,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146865739] [2024-11-17 02:45:56,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:45:56,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:45:57,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:45:57,166 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-17 02:45:57,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:45:57,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146865739] [2024-11-17 02:45:57,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146865739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:45:57,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:45:57,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:45:57,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270792566] [2024-11-17 02:45:57,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:45:57,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:45:57,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:45:57,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:45:57,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:45:57,206 INFO L87 Difference]: Start difference. First operand has 1073 states, 651 states have (on average 1.9831029185867897) internal successors, (1291), 1068 states have internal predecessors, (1291), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-17 02:45:57,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:45:57,903 INFO L93 Difference]: Finished difference Result 1059 states and 1224 transitions. [2024-11-17 02:45:57,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:45:57,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-17 02:45:57,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:45:57,922 INFO L225 Difference]: With dead ends: 1059 [2024-11-17 02:45:57,923 INFO L226 Difference]: Without dead ends: 1056 [2024-11-17 02:45:57,924 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-17 02:45:57,927 INFO L432 NwaCegarLoop]: 796 mSDtfsCounter, 1103 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1106 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:45:57,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1106 Valid, 842 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 02:45:57,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2024-11-17 02:45:58,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1056. [2024-11-17 02:45:58,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1056 states, 651 states have (on average 1.8663594470046083) internal successors, (1215), 1051 states have internal predecessors, (1215), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:45:58,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1056 states to 1056 states and 1221 transitions. [2024-11-17 02:45:58,009 INFO L78 Accepts]: Start accepts. Automaton has 1056 states and 1221 transitions. Word has length 4 [2024-11-17 02:45:58,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:45:58,010 INFO L471 AbstractCegarLoop]: Abstraction has 1056 states and 1221 transitions. [2024-11-17 02:45:58,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-17 02:45:58,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1221 transitions. [2024-11-17 02:45:58,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-17 02:45:58,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:45:58,011 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-17 02:45:58,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-17 02:45:58,011 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr419REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:45:58,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:45:58,012 INFO L85 PathProgramCache]: Analyzing trace with hash 42419325, now seen corresponding path program 1 times [2024-11-17 02:45:58,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:45:58,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60225021] [2024-11-17 02:45:58,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:45:58,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:45:58,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:45:58,143 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-17 02:45:58,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:45:58,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60225021] [2024-11-17 02:45:58,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60225021] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:45:58,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:45:58,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:45:58,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300570530] [2024-11-17 02:45:58,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:45:58,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:45:58,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:45:58,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:45:58,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:45:58,149 INFO L87 Difference]: Start difference. First operand 1056 states and 1221 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-17 02:45:58,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:45:58,827 INFO L93 Difference]: Finished difference Result 1368 states and 1610 transitions. [2024-11-17 02:45:58,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:45:58,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-11-17 02:45:58,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:45:58,833 INFO L225 Difference]: With dead ends: 1368 [2024-11-17 02:45:58,833 INFO L226 Difference]: Without dead ends: 1368 [2024-11-17 02:45:58,834 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-17 02:45:58,835 INFO L432 NwaCegarLoop]: 1076 mSDtfsCounter, 389 mSDsluCounter, 751 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 1827 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:45:58,835 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 1827 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 02:45:58,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2024-11-17 02:45:58,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1282. [2024-11-17 02:45:58,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 878 states have (on average 1.8234624145785876) internal successors, (1601), 1277 states have internal predecessors, (1601), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:45:58,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1607 transitions. [2024-11-17 02:45:58,871 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1607 transitions. Word has length 4 [2024-11-17 02:45:58,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:45:58,871 INFO L471 AbstractCegarLoop]: Abstraction has 1282 states and 1607 transitions. [2024-11-17 02:45:58,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-17 02:45:58,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1607 transitions. [2024-11-17 02:45:58,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-17 02:45:58,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:45:58,873 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-17 02:45:58,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-17 02:45:58,876 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:45:58,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:45:58,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1314957056, now seen corresponding path program 1 times [2024-11-17 02:45:58,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:45:58,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973436545] [2024-11-17 02:45:58,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:45:58,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:45:58,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:45:59,041 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-17 02:45:59,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:45:59,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973436545] [2024-11-17 02:45:59,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973436545] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:45:59,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:45:59,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:45:59,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323837967] [2024-11-17 02:45:59,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:45:59,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:45:59,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:45:59,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:45:59,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:45:59,046 INFO L87 Difference]: Start difference. First operand 1282 states and 1607 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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-17 02:45:59,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:45:59,842 INFO L93 Difference]: Finished difference Result 1370 states and 1611 transitions. [2024-11-17 02:45:59,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:45:59,843 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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-17 02:45:59,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:45:59,849 INFO L225 Difference]: With dead ends: 1370 [2024-11-17 02:45:59,849 INFO L226 Difference]: Without dead ends: 1367 [2024-11-17 02:45:59,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-17 02:45:59,853 INFO L432 NwaCegarLoop]: 1076 mSDtfsCounter, 390 mSDsluCounter, 1506 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 2582 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-17 02:45:59,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 2582 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-17 02:45:59,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2024-11-17 02:45:59,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1282. [2024-11-17 02:45:59,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1282 states, 878 states have (on average 1.8211845102505695) internal successors, (1599), 1277 states have internal predecessors, (1599), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:45:59,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1605 transitions. [2024-11-17 02:45:59,879 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1605 transitions. Word has length 5 [2024-11-17 02:45:59,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:45:59,879 INFO L471 AbstractCegarLoop]: Abstraction has 1282 states and 1605 transitions. [2024-11-17 02:45:59,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 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-17 02:45:59,880 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1605 transitions. [2024-11-17 02:45:59,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-17 02:45:59,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:45:59,880 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:45:59,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-17 02:45:59,881 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr415REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:45:59,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:45:59,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1586509379, now seen corresponding path program 1 times [2024-11-17 02:45:59,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:45:59,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976211249] [2024-11-17 02:45:59,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:45:59,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:45:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:00,058 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-17 02:46:00,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:00,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976211249] [2024-11-17 02:46:00,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976211249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:00,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:00,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:46:00,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480424582] [2024-11-17 02:46:00,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:00,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 02:46:00,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:00,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 02:46:00,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:46:00,060 INFO L87 Difference]: Start difference. First operand 1282 states and 1605 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-17 02:46:01,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:01,121 INFO L93 Difference]: Finished difference Result 1356 states and 1595 transitions. [2024-11-17 02:46:01,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:46:01,121 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-17 02:46:01,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:01,126 INFO L225 Difference]: With dead ends: 1356 [2024-11-17 02:46:01,126 INFO L226 Difference]: Without dead ends: 1356 [2024-11-17 02:46:01,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-17 02:46:01,128 INFO L432 NwaCegarLoop]: 802 mSDtfsCounter, 3370 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3370 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:01,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3370 Valid, 1065 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-17 02:46:01,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2024-11-17 02:46:01,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1271. [2024-11-17 02:46:01,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 878 states have (on average 1.8075170842824602) internal successors, (1587), 1266 states have internal predecessors, (1587), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:46:01,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1593 transitions. [2024-11-17 02:46:01,151 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1593 transitions. Word has length 9 [2024-11-17 02:46:01,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:01,151 INFO L471 AbstractCegarLoop]: Abstraction has 1271 states and 1593 transitions. [2024-11-17 02:46:01,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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-17 02:46:01,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1593 transitions. [2024-11-17 02:46:01,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 02:46:01,152 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:01,152 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:46:01,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-17 02:46:01,153 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr412REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:46:01,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:01,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1937149230, now seen corresponding path program 1 times [2024-11-17 02:46:01,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:01,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662887149] [2024-11-17 02:46:01,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:01,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:01,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:01,196 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-17 02:46:01,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:01,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662887149] [2024-11-17 02:46:01,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662887149] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:01,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:01,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:46:01,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661594662] [2024-11-17 02:46:01,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:01,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:46:01,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:01,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:46:01,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:46:01,199 INFO L87 Difference]: Start difference. First operand 1271 states and 1593 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:46:01,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:01,840 INFO L93 Difference]: Finished difference Result 1309 states and 1548 transitions. [2024-11-17 02:46:01,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:46:01,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-17 02:46:01,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:01,845 INFO L225 Difference]: With dead ends: 1309 [2024-11-17 02:46:01,845 INFO L226 Difference]: Without dead ends: 1309 [2024-11-17 02:46:01,845 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-17 02:46:01,846 INFO L432 NwaCegarLoop]: 1076 mSDtfsCounter, 1077 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1080 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:01,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1080 Valid, 1362 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 02:46:01,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2024-11-17 02:46:01,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1224. [2024-11-17 02:46:01,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 878 states have (on average 1.753986332574032) internal successors, (1540), 1219 states have internal predecessors, (1540), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:46:01,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1546 transitions. [2024-11-17 02:46:01,867 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1546 transitions. Word has length 10 [2024-11-17 02:46:01,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:01,868 INFO L471 AbstractCegarLoop]: Abstraction has 1224 states and 1546 transitions. [2024-11-17 02:46:01,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:46:01,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1546 transitions. [2024-11-17 02:46:01,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-17 02:46:01,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:01,869 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:46:01,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-17 02:46:01,869 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr413REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:46:01,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:01,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1937149229, now seen corresponding path program 1 times [2024-11-17 02:46:01,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:01,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168790138] [2024-11-17 02:46:01,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:01,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:01,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:01,985 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-17 02:46:01,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:01,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168790138] [2024-11-17 02:46:01,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168790138] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:01,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:01,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-17 02:46:01,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88593960] [2024-11-17 02:46:01,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:01,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:46:01,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:01,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:46:01,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:46:01,990 INFO L87 Difference]: Start difference. First operand 1224 states and 1546 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:46:02,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:02,578 INFO L93 Difference]: Finished difference Result 1518 states and 1916 transitions. [2024-11-17 02:46:02,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:46:02,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-17 02:46:02,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:02,583 INFO L225 Difference]: With dead ends: 1518 [2024-11-17 02:46:02,583 INFO L226 Difference]: Without dead ends: 1518 [2024-11-17 02:46:02,583 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-17 02:46:02,584 INFO L432 NwaCegarLoop]: 1210 mSDtfsCounter, 866 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 868 SdHoareTripleChecker+Valid, 1615 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:02,584 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [868 Valid, 1615 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 02:46:02,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1518 states. [2024-11-17 02:46:02,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1518 to 1199. [2024-11-17 02:46:02,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 878 states have (on average 1.7255125284738042) internal successors, (1515), 1194 states have internal predecessors, (1515), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:46:02,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1521 transitions. [2024-11-17 02:46:02,606 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1521 transitions. Word has length 10 [2024-11-17 02:46:02,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:02,606 INFO L471 AbstractCegarLoop]: Abstraction has 1199 states and 1521 transitions. [2024-11-17 02:46:02,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:46:02,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1521 transitions. [2024-11-17 02:46:02,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 02:46:02,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:02,607 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:46:02,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-17 02:46:02,608 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:46:02,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:02,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1136367309, now seen corresponding path program 1 times [2024-11-17 02:46:02,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:02,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800574470] [2024-11-17 02:46:02,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:02,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:02,653 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-17 02:46:02,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:02,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800574470] [2024-11-17 02:46:02,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800574470] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:02,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:02,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:46:02,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688820310] [2024-11-17 02:46:02,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:02,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:46:02,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:02,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:46:02,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:46:02,656 INFO L87 Difference]: Start difference. First operand 1199 states and 1521 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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-17 02:46:03,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:03,205 INFO L93 Difference]: Finished difference Result 1274 states and 1627 transitions. [2024-11-17 02:46:03,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:46:03,205 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2024-11-17 02:46:03,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:03,208 INFO L225 Difference]: With dead ends: 1274 [2024-11-17 02:46:03,209 INFO L226 Difference]: Without dead ends: 1274 [2024-11-17 02:46:03,209 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-17 02:46:03,209 INFO L432 NwaCegarLoop]: 736 mSDtfsCounter, 1301 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1304 SdHoareTripleChecker+Valid, 1359 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:03,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1304 Valid, 1359 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 02:46:03,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2024-11-17 02:46:03,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1176. [2024-11-17 02:46:03,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1176 states, 878 states have (on average 1.673120728929385) internal successors, (1469), 1171 states have internal predecessors, (1469), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:46:03,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1176 states to 1176 states and 1475 transitions. [2024-11-17 02:46:03,227 INFO L78 Accepts]: Start accepts. Automaton has 1176 states and 1475 transitions. Word has length 17 [2024-11-17 02:46:03,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:03,228 INFO L471 AbstractCegarLoop]: Abstraction has 1176 states and 1475 transitions. [2024-11-17 02:46:03,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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-17 02:46:03,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1176 states and 1475 transitions. [2024-11-17 02:46:03,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-17 02:46:03,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:03,229 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:46:03,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-17 02:46:03,229 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:46:03,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:03,230 INFO L85 PathProgramCache]: Analyzing trace with hash -1136367308, now seen corresponding path program 1 times [2024-11-17 02:46:03,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:03,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546992066] [2024-11-17 02:46:03,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:03,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:03,275 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-17 02:46:03,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:03,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546992066] [2024-11-17 02:46:03,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546992066] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:03,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:03,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:46:03,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917144965] [2024-11-17 02:46:03,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:03,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:46:03,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:03,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:46:03,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:46:03,278 INFO L87 Difference]: Start difference. First operand 1176 states and 1475 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-17 02:46:03,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:03,369 INFO L93 Difference]: Finished difference Result 1038 states and 1269 transitions. [2024-11-17 02:46:03,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:46:03,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2024-11-17 02:46:03,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:03,373 INFO L225 Difference]: With dead ends: 1038 [2024-11-17 02:46:03,373 INFO L226 Difference]: Without dead ends: 1038 [2024-11-17 02:46:03,373 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-17 02:46:03,374 INFO L432 NwaCegarLoop]: 957 mSDtfsCounter, 61 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1860 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:03,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1860 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:46:03,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1038 states. [2024-11-17 02:46:03,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1038 to 1038. [2024-11-17 02:46:03,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 752 states have (on average 1.6795212765957446) internal successors, (1263), 1033 states have internal predecessors, (1263), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:46:03,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 1269 transitions. [2024-11-17 02:46:03,388 INFO L78 Accepts]: Start accepts. Automaton has 1038 states and 1269 transitions. Word has length 17 [2024-11-17 02:46:03,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:03,388 INFO L471 AbstractCegarLoop]: Abstraction has 1038 states and 1269 transitions. [2024-11-17 02:46:03,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-17 02:46:03,389 INFO L276 IsEmpty]: Start isEmpty. Operand 1038 states and 1269 transitions. [2024-11-17 02:46:03,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-17 02:46:03,390 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:03,390 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:46:03,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-17 02:46:03,390 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:46:03,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:03,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1127429641, now seen corresponding path program 1 times [2024-11-17 02:46:03,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:03,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063373727] [2024-11-17 02:46:03,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:03,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:03,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:03,450 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-17 02:46:03,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:03,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063373727] [2024-11-17 02:46:03,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063373727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:03,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:03,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:46:03,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181122445] [2024-11-17 02:46:03,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:03,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:46:03,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:03,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:46:03,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:46:03,454 INFO L87 Difference]: Start difference. First operand 1038 states and 1269 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-17 02:46:03,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:03,567 INFO L93 Difference]: Finished difference Result 1015 states and 1225 transitions. [2024-11-17 02:46:03,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:46:03,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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 19 [2024-11-17 02:46:03,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:03,571 INFO L225 Difference]: With dead ends: 1015 [2024-11-17 02:46:03,571 INFO L226 Difference]: Without dead ends: 1015 [2024-11-17 02:46:03,571 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-17 02:46:03,572 INFO L432 NwaCegarLoop]: 919 mSDtfsCounter, 45 mSDsluCounter, 1814 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2733 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:03,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2733 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:46:03,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2024-11-17 02:46:03,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 1015. [2024-11-17 02:46:03,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1015 states, 736 states have (on average 1.65625) internal successors, (1219), 1010 states have internal predecessors, (1219), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:46:03,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1015 states to 1015 states and 1225 transitions. [2024-11-17 02:46:03,585 INFO L78 Accepts]: Start accepts. Automaton has 1015 states and 1225 transitions. Word has length 19 [2024-11-17 02:46:03,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:03,586 INFO L471 AbstractCegarLoop]: Abstraction has 1015 states and 1225 transitions. [2024-11-17 02:46:03,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-17 02:46:03,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1015 states and 1225 transitions. [2024-11-17 02:46:03,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 02:46:03,586 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:03,587 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:46:03,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-17 02:46:03,587 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr404REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:46:03,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:03,587 INFO L85 PathProgramCache]: Analyzing trace with hash 979179695, now seen corresponding path program 1 times [2024-11-17 02:46:03,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:03,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462795570] [2024-11-17 02:46:03,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:03,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:03,640 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-17 02:46:03,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:03,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462795570] [2024-11-17 02:46:03,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462795570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:03,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:03,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:46:03,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306121032] [2024-11-17 02:46:03,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:03,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:46:03,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:03,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:46:03,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:46:03,642 INFO L87 Difference]: Start difference. First operand 1015 states and 1225 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:46:04,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:04,176 INFO L93 Difference]: Finished difference Result 1084 states and 1280 transitions. [2024-11-17 02:46:04,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:46:04,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-17 02:46:04,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:04,180 INFO L225 Difference]: With dead ends: 1084 [2024-11-17 02:46:04,180 INFO L226 Difference]: Without dead ends: 1084 [2024-11-17 02:46:04,181 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-17 02:46:04,181 INFO L432 NwaCegarLoop]: 804 mSDtfsCounter, 1188 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1191 SdHoareTripleChecker+Valid, 1616 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:04,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1191 Valid, 1616 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 02:46:04,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2024-11-17 02:46:04,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 992. [2024-11-17 02:46:04,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 736 states have (on average 1.625) internal successors, (1196), 987 states have internal predecessors, (1196), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:46:04,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1202 transitions. [2024-11-17 02:46:04,197 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1202 transitions. Word has length 21 [2024-11-17 02:46:04,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:04,197 INFO L471 AbstractCegarLoop]: Abstraction has 992 states and 1202 transitions. [2024-11-17 02:46:04,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:46:04,197 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1202 transitions. [2024-11-17 02:46:04,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-17 02:46:04,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:04,198 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:46:04,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-17 02:46:04,199 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr405REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:46:04,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:04,200 INFO L85 PathProgramCache]: Analyzing trace with hash 979179696, now seen corresponding path program 1 times [2024-11-17 02:46:04,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:04,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120611840] [2024-11-17 02:46:04,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:04,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:04,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:04,278 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-17 02:46:04,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:04,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120611840] [2024-11-17 02:46:04,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120611840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:04,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:04,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:46:04,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478406588] [2024-11-17 02:46:04,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:04,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:46:04,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:04,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:46:04,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:46:04,279 INFO L87 Difference]: Start difference. First operand 992 states and 1202 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:46:04,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:04,339 INFO L93 Difference]: Finished difference Result 917 states and 1099 transitions. [2024-11-17 02:46:04,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:46:04,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-17 02:46:04,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:04,342 INFO L225 Difference]: With dead ends: 917 [2024-11-17 02:46:04,342 INFO L226 Difference]: Without dead ends: 917 [2024-11-17 02:46:04,342 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-17 02:46:04,343 INFO L432 NwaCegarLoop]: 812 mSDtfsCounter, 61 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1570 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:04,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1570 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:46:04,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 917 states. [2024-11-17 02:46:04,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 917 to 917. [2024-11-17 02:46:04,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 917 states, 673 states have (on average 1.62407132243685) internal successors, (1093), 912 states have internal predecessors, (1093), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:46:04,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1099 transitions. [2024-11-17 02:46:04,356 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1099 transitions. Word has length 21 [2024-11-17 02:46:04,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:04,357 INFO L471 AbstractCegarLoop]: Abstraction has 917 states and 1099 transitions. [2024-11-17 02:46:04,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:46:04,358 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1099 transitions. [2024-11-17 02:46:04,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-17 02:46:04,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:04,358 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:46:04,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-17 02:46:04,359 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr381REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:46:04,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:04,360 INFO L85 PathProgramCache]: Analyzing trace with hash 393737715, now seen corresponding path program 1 times [2024-11-17 02:46:04,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:04,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891450498] [2024-11-17 02:46:04,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:04,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:04,444 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-17 02:46:04,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:04,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891450498] [2024-11-17 02:46:04,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891450498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:04,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:04,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:46:04,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164562082] [2024-11-17 02:46:04,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:04,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:46:04,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:04,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:46:04,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:46:04,446 INFO L87 Difference]: Start difference. First operand 917 states and 1099 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:46:04,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:04,538 INFO L93 Difference]: Finished difference Result 902 states and 1077 transitions. [2024-11-17 02:46:04,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:46:04,539 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-17 02:46:04,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:04,541 INFO L225 Difference]: With dead ends: 902 [2024-11-17 02:46:04,541 INFO L226 Difference]: Without dead ends: 902 [2024-11-17 02:46:04,541 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-17 02:46:04,542 INFO L432 NwaCegarLoop]: 774 mSDtfsCounter, 45 mSDsluCounter, 1524 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2298 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:04,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2298 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:46:04,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 902 states. [2024-11-17 02:46:04,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 902 to 902. [2024-11-17 02:46:04,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 665 states have (on average 1.6105263157894736) internal successors, (1071), 897 states have internal predecessors, (1071), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-11-17 02:46:04,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1077 transitions. [2024-11-17 02:46:04,555 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1077 transitions. Word has length 23 [2024-11-17 02:46:04,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:04,555 INFO L471 AbstractCegarLoop]: Abstraction has 902 states and 1077 transitions. [2024-11-17 02:46:04,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:46:04,556 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1077 transitions. [2024-11-17 02:46:04,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-17 02:46:04,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:04,557 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] [2024-11-17 02:46:04,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-17 02:46:04,557 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:46:04,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:04,557 INFO L85 PathProgramCache]: Analyzing trace with hash -120478259, now seen corresponding path program 1 times [2024-11-17 02:46:04,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:04,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573986434] [2024-11-17 02:46:04,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:04,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:04,676 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-17 02:46:04,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:04,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573986434] [2024-11-17 02:46:04,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573986434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:04,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:04,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:46:04,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300842959] [2024-11-17 02:46:04,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:04,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:46:04,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:04,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:46:04,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:46:04,678 INFO L87 Difference]: Start difference. First operand 902 states and 1077 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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-17 02:46:05,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:05,275 INFO L93 Difference]: Finished difference Result 1493 states and 1799 transitions. [2024-11-17 02:46:05,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:46:05,276 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 33 [2024-11-17 02:46:05,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:05,280 INFO L225 Difference]: With dead ends: 1493 [2024-11-17 02:46:05,280 INFO L226 Difference]: Without dead ends: 1493 [2024-11-17 02:46:05,280 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-17 02:46:05,280 INFO L432 NwaCegarLoop]: 630 mSDtfsCounter, 711 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 1605 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:05,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 1605 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 02:46:05,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2024-11-17 02:46:05,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1271. [2024-11-17 02:46:05,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1271 states, 1034 states have (on average 1.574468085106383) internal successors, (1628), 1264 states have internal predecessors, (1628), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 02:46:05,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1271 states to 1271 states and 1638 transitions. [2024-11-17 02:46:05,302 INFO L78 Accepts]: Start accepts. Automaton has 1271 states and 1638 transitions. Word has length 33 [2024-11-17 02:46:05,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:05,302 INFO L471 AbstractCegarLoop]: Abstraction has 1271 states and 1638 transitions. [2024-11-17 02:46:05,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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-17 02:46:05,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1271 states and 1638 transitions. [2024-11-17 02:46:05,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-17 02:46:05,303 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:05,303 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:46:05,304 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-17 02:46:05,304 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr367REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:46:05,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:05,307 INFO L85 PathProgramCache]: Analyzing trace with hash -2142324407, now seen corresponding path program 1 times [2024-11-17 02:46:05,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:05,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676611436] [2024-11-17 02:46:05,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:05,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:05,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:05,482 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-17 02:46:05,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:05,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676611436] [2024-11-17 02:46:05,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676611436] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:05,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:05,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:46:05,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506276349] [2024-11-17 02:46:05,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:05,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:46:05,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:05,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:46:05,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:46:05,484 INFO L87 Difference]: Start difference. First operand 1271 states and 1638 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:46:06,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:06,045 INFO L93 Difference]: Finished difference Result 1571 states and 2029 transitions. [2024-11-17 02:46:06,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-17 02:46:06,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-17 02:46:06,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:06,049 INFO L225 Difference]: With dead ends: 1571 [2024-11-17 02:46:06,049 INFO L226 Difference]: Without dead ends: 1571 [2024-11-17 02:46:06,049 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-17 02:46:06,050 INFO L432 NwaCegarLoop]: 851 mSDtfsCounter, 713 mSDsluCounter, 927 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 1778 SdHoareTripleChecker+Invalid, 792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:06,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 1778 Invalid, 792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-17 02:46:06,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2024-11-17 02:46:06,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1267. [2024-11-17 02:46:06,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1267 states, 1034 states have (on average 1.5667311411992264) internal successors, (1620), 1260 states have internal predecessors, (1620), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 02:46:06,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1267 states to 1267 states and 1630 transitions. [2024-11-17 02:46:06,068 INFO L78 Accepts]: Start accepts. Automaton has 1267 states and 1630 transitions. Word has length 37 [2024-11-17 02:46:06,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:06,068 INFO L471 AbstractCegarLoop]: Abstraction has 1267 states and 1630 transitions. [2024-11-17 02:46:06,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:46:06,068 INFO L276 IsEmpty]: Start isEmpty. Operand 1267 states and 1630 transitions. [2024-11-17 02:46:06,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-17 02:46:06,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:06,070 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] [2024-11-17 02:46:06,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-17 02:46:06,070 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:46:06,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:06,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1254026296, now seen corresponding path program 1 times [2024-11-17 02:46:06,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:06,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106625589] [2024-11-17 02:46:06,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:06,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:06,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:06,140 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-17 02:46:06,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:06,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106625589] [2024-11-17 02:46:06,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106625589] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:06,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:06,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:46:06,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842516740] [2024-11-17 02:46:06,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:06,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:46:06,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:06,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:46:06,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:46:06,142 INFO L87 Difference]: Start difference. First operand 1267 states and 1630 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-17 02:46:06,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:06,220 INFO L93 Difference]: Finished difference Result 1249 states and 1600 transitions. [2024-11-17 02:46:06,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:46:06,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 66 [2024-11-17 02:46:06,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:06,224 INFO L225 Difference]: With dead ends: 1249 [2024-11-17 02:46:06,224 INFO L226 Difference]: Without dead ends: 1249 [2024-11-17 02:46:06,224 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-17 02:46:06,225 INFO L432 NwaCegarLoop]: 772 mSDtfsCounter, 27 mSDsluCounter, 1506 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2278 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:06,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2278 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:46:06,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2024-11-17 02:46:06,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 1249. [2024-11-17 02:46:06,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1016 states have (on average 1.56496062992126) internal successors, (1590), 1242 states have internal predecessors, (1590), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 02:46:06,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1600 transitions. [2024-11-17 02:46:06,241 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1600 transitions. Word has length 66 [2024-11-17 02:46:06,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:06,241 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 1600 transitions. [2024-11-17 02:46:06,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-17 02:46:06,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1600 transitions. [2024-11-17 02:46:06,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-17 02:46:06,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:06,243 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:46:06,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-17 02:46:06,243 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr352REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:46:06,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:06,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1216220573, now seen corresponding path program 1 times [2024-11-17 02:46:06,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:06,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059607896] [2024-11-17 02:46:06,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:06,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:06,331 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-17 02:46:06,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:06,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059607896] [2024-11-17 02:46:06,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059607896] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:06,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:06,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:46:06,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044871918] [2024-11-17 02:46:06,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:06,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-17 02:46:06,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:06,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-17 02:46:06,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-17 02:46:06,334 INFO L87 Difference]: Start difference. First operand 1249 states and 1600 transitions. Second operand has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:46:06,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:06,420 INFO L93 Difference]: Finished difference Result 1237 states and 1580 transitions. [2024-11-17 02:46:06,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-17 02:46:06,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-17 02:46:06,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:06,425 INFO L225 Difference]: With dead ends: 1237 [2024-11-17 02:46:06,425 INFO L226 Difference]: Without dead ends: 1237 [2024-11-17 02:46:06,425 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-17 02:46:06,425 INFO L432 NwaCegarLoop]: 768 mSDtfsCounter, 21 mSDsluCounter, 1504 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2272 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:06,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2272 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:46:06,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2024-11-17 02:46:06,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1237. [2024-11-17 02:46:06,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1237 states, 1004 states have (on average 1.5637450199203187) internal successors, (1570), 1230 states have internal predecessors, (1570), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 02:46:06,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1237 states to 1237 states and 1580 transitions. [2024-11-17 02:46:06,441 INFO L78 Accepts]: Start accepts. Automaton has 1237 states and 1580 transitions. Word has length 72 [2024-11-17 02:46:06,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:06,441 INFO L471 AbstractCegarLoop]: Abstraction has 1237 states and 1580 transitions. [2024-11-17 02:46:06,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.0) internal successors, (72), 4 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:46:06,442 INFO L276 IsEmpty]: Start isEmpty. Operand 1237 states and 1580 transitions. [2024-11-17 02:46:06,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-17 02:46:06,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:06,443 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] [2024-11-17 02:46:06,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-17 02:46:06,443 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:46:06,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:06,443 INFO L85 PathProgramCache]: Analyzing trace with hash 538661248, now seen corresponding path program 1 times [2024-11-17 02:46:06,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:06,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685298300] [2024-11-17 02:46:06,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:06,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:06,557 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-17 02:46:06,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:06,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685298300] [2024-11-17 02:46:06,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685298300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:06,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:06,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-17 02:46:06,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740819002] [2024-11-17 02:46:06,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:06,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-17 02:46:06,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:06,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-17 02:46:06,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-17 02:46:06,561 INFO L87 Difference]: Start difference. First operand 1237 states and 1580 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-17 02:46:06,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:06,646 INFO L93 Difference]: Finished difference Result 1501 states and 1882 transitions. [2024-11-17 02:46:06,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-17 02:46:06,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 74 [2024-11-17 02:46:06,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:06,651 INFO L225 Difference]: With dead ends: 1501 [2024-11-17 02:46:06,651 INFO L226 Difference]: Without dead ends: 1501 [2024-11-17 02:46:06,652 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-17 02:46:06,652 INFO L432 NwaCegarLoop]: 790 mSDtfsCounter, 201 mSDsluCounter, 737 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1527 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:06,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1527 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-17 02:46:06,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2024-11-17 02:46:06,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1490. [2024-11-17 02:46:06,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1490 states, 1257 states have (on average 1.4852824184566429) internal successors, (1867), 1483 states have internal predecessors, (1867), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 02:46:06,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 1877 transitions. [2024-11-17 02:46:06,673 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 1877 transitions. Word has length 74 [2024-11-17 02:46:06,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:06,674 INFO L471 AbstractCegarLoop]: Abstraction has 1490 states and 1877 transitions. [2024-11-17 02:46:06,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-17 02:46:06,674 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 1877 transitions. [2024-11-17 02:46:06,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-11-17 02:46:06,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:06,675 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:46:06,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-17 02:46:06,675 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:46:06,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:06,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1058372448, now seen corresponding path program 1 times [2024-11-17 02:46:06,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:06,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883361309] [2024-11-17 02:46:06,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:06,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:06,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-17 02:46:06,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:06,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883361309] [2024-11-17 02:46:06,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883361309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:06,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:06,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-17 02:46:06,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204632084] [2024-11-17 02:46:06,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:06,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 02:46:06,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:06,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 02:46:06,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-17 02:46:06,994 INFO L87 Difference]: Start difference. First operand 1490 states and 1877 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:46:07,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:07,211 INFO L93 Difference]: Finished difference Result 2129 states and 2621 transitions. [2024-11-17 02:46:07,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:46:07,211 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 79 [2024-11-17 02:46:07,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:07,216 INFO L225 Difference]: With dead ends: 2129 [2024-11-17 02:46:07,216 INFO L226 Difference]: Without dead ends: 2125 [2024-11-17 02:46:07,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-17 02:46:07,217 INFO L432 NwaCegarLoop]: 763 mSDtfsCounter, 744 mSDsluCounter, 3041 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 3804 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:07,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 3804 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-17 02:46:07,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2024-11-17 02:46:07,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 1389. [2024-11-17 02:46:07,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1389 states, 1156 states have (on average 1.5025951557093427) internal successors, (1737), 1382 states have internal predecessors, (1737), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 02:46:07,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1389 states to 1389 states and 1747 transitions. [2024-11-17 02:46:07,249 INFO L78 Accepts]: Start accepts. Automaton has 1389 states and 1747 transitions. Word has length 79 [2024-11-17 02:46:07,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:07,250 INFO L471 AbstractCegarLoop]: Abstraction has 1389 states and 1747 transitions. [2024-11-17 02:46:07,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 7 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-17 02:46:07,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1389 states and 1747 transitions. [2024-11-17 02:46:07,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-17 02:46:07,251 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:07,251 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:46:07,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-17 02:46:07,252 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr316REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:46:07,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:07,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1288437414, now seen corresponding path program 1 times [2024-11-17 02:46:07,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:07,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549312910] [2024-11-17 02:46:07,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:07,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:07,522 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-17 02:46:07,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:07,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549312910] [2024-11-17 02:46:07,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549312910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:07,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:07,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:46:07,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143745531] [2024-11-17 02:46:07,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:07,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 02:46:07,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:07,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 02:46:07,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:46:07,525 INFO L87 Difference]: Start difference. First operand 1389 states and 1747 transitions. Second operand has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 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-17 02:46:08,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:08,137 INFO L93 Difference]: Finished difference Result 1388 states and 1745 transitions. [2024-11-17 02:46:08,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:46:08,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 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 88 [2024-11-17 02:46:08,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:08,142 INFO L225 Difference]: With dead ends: 1388 [2024-11-17 02:46:08,143 INFO L226 Difference]: Without dead ends: 1388 [2024-11-17 02:46:08,143 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-17 02:46:08,143 INFO L432 NwaCegarLoop]: 779 mSDtfsCounter, 2 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2260 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:08,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2260 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-17 02:46:08,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2024-11-17 02:46:08,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 1388. [2024-11-17 02:46:08,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1388 states, 1156 states have (on average 1.5008650519031141) internal successors, (1735), 1381 states have internal predecessors, (1735), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 02:46:08,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 1745 transitions. [2024-11-17 02:46:08,162 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 1745 transitions. Word has length 88 [2024-11-17 02:46:08,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:08,163 INFO L471 AbstractCegarLoop]: Abstraction has 1388 states and 1745 transitions. [2024-11-17 02:46:08,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 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-17 02:46:08,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1745 transitions. [2024-11-17 02:46:08,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-17 02:46:08,165 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:08,165 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:46:08,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-17 02:46:08,166 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr317REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:46:08,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:08,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1288437415, now seen corresponding path program 1 times [2024-11-17 02:46:08,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:08,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739462276] [2024-11-17 02:46:08,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:08,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:08,652 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-17 02:46:08,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:08,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739462276] [2024-11-17 02:46:08,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739462276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:08,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:08,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-17 02:46:08,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765918254] [2024-11-17 02:46:08,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:08,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-17 02:46:08,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:08,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-17 02:46:08,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-17 02:46:08,654 INFO L87 Difference]: Start difference. First operand 1388 states and 1745 transitions. Second operand has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 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-17 02:46:09,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:09,383 INFO L93 Difference]: Finished difference Result 1387 states and 1743 transitions. [2024-11-17 02:46:09,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:46:09,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 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 88 [2024-11-17 02:46:09,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:09,389 INFO L225 Difference]: With dead ends: 1387 [2024-11-17 02:46:09,389 INFO L226 Difference]: Without dead ends: 1387 [2024-11-17 02:46:09,389 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-17 02:46:09,390 INFO L432 NwaCegarLoop]: 779 mSDtfsCounter, 1 mSDsluCounter, 1443 mSDsCounter, 0 mSdLazyCounter, 990 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2222 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:09,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2222 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 990 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-17 02:46:09,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2024-11-17 02:46:09,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1387. [2024-11-17 02:46:09,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1387 states, 1154 states have (on average 1.501733102253033) internal successors, (1733), 1380 states have internal predecessors, (1733), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 02:46:09,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1387 states to 1387 states and 1743 transitions. [2024-11-17 02:46:09,411 INFO L78 Accepts]: Start accepts. Automaton has 1387 states and 1743 transitions. Word has length 88 [2024-11-17 02:46:09,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:09,412 INFO L471 AbstractCegarLoop]: Abstraction has 1387 states and 1743 transitions. [2024-11-17 02:46:09,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 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-17 02:46:09,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1387 states and 1743 transitions. [2024-11-17 02:46:09,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-17 02:46:09,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:09,413 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-17 02:46:09,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-17 02:46:09,413 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:46:09,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:09,413 INFO L85 PathProgramCache]: Analyzing trace with hash 666727235, now seen corresponding path program 1 times [2024-11-17 02:46:09,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:09,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190549926] [2024-11-17 02:46:09,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:09,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:09,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 02:46:09,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:09,655 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-17 02:46:09,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:09,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190549926] [2024-11-17 02:46:09,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190549926] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:09,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:09,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 02:46:09,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330833753] [2024-11-17 02:46:09,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:09,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 02:46:09,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:09,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 02:46:09,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-17 02:46:09,659 INFO L87 Difference]: Start difference. First operand 1387 states and 1743 transitions. Second operand has 7 states, 5 states have (on average 18.8) internal successors, (94), 6 states have internal predecessors, (94), 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-17 02:46:10,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:10,519 INFO L93 Difference]: Finished difference Result 1405 states and 1769 transitions. [2024-11-17 02:46:10,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-17 02:46:10,522 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.8) internal successors, (94), 6 states have internal predecessors, (94), 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 96 [2024-11-17 02:46:10,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:10,529 INFO L225 Difference]: With dead ends: 1405 [2024-11-17 02:46:10,530 INFO L226 Difference]: Without dead ends: 1405 [2024-11-17 02:46:10,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-17 02:46:10,531 INFO L432 NwaCegarLoop]: 771 mSDtfsCounter, 10 mSDsluCounter, 2728 mSDsCounter, 0 mSdLazyCounter, 1323 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 3499 SdHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:10,531 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 3499 Invalid, 1327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1323 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-17 02:46:10,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2024-11-17 02:46:10,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 1396. [2024-11-17 02:46:10,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1396 states, 1162 states have (on average 1.5008605851979346) internal successors, (1744), 1387 states have internal predecessors, (1744), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-17 02:46:10,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 1759 transitions. [2024-11-17 02:46:10,558 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 1759 transitions. Word has length 96 [2024-11-17 02:46:10,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:10,559 INFO L471 AbstractCegarLoop]: Abstraction has 1396 states and 1759 transitions. [2024-11-17 02:46:10,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.8) internal successors, (94), 6 states have internal predecessors, (94), 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-17 02:46:10,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 1759 transitions. [2024-11-17 02:46:10,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-17 02:46:10,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:10,560 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-17 02:46:10,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-17 02:46:10,560 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr313REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:46:10,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:10,561 INFO L85 PathProgramCache]: Analyzing trace with hash 666727236, now seen corresponding path program 1 times [2024-11-17 02:46:10,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:10,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467239765] [2024-11-17 02:46:10,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:10,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:10,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:11,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 02:46:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:11,070 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-17 02:46:11,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:11,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467239765] [2024-11-17 02:46:11,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467239765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:11,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:11,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-17 02:46:11,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582001446] [2024-11-17 02:46:11,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:11,072 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-17 02:46:11,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:11,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-17 02:46:11,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-17 02:46:11,074 INFO L87 Difference]: Start difference. First operand 1396 states and 1759 transitions. Second operand has 7 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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-17 02:46:11,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:11,865 INFO L93 Difference]: Finished difference Result 1396 states and 1757 transitions. [2024-11-17 02:46:11,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-17 02:46:11,866 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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 96 [2024-11-17 02:46:11,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:11,870 INFO L225 Difference]: With dead ends: 1396 [2024-11-17 02:46:11,870 INFO L226 Difference]: Without dead ends: 1396 [2024-11-17 02:46:11,871 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-17 02:46:11,872 INFO L432 NwaCegarLoop]: 775 mSDtfsCounter, 5 mSDsluCounter, 2728 mSDsCounter, 0 mSdLazyCounter, 1311 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 3503 SdHoareTripleChecker+Invalid, 1313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:11,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 3503 Invalid, 1313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1311 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-17 02:46:11,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2024-11-17 02:46:11,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1396. [2024-11-17 02:46:11,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1396 states, 1162 states have (on average 1.4991394148020654) internal successors, (1742), 1387 states have internal predecessors, (1742), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-17 02:46:11,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 1757 transitions. [2024-11-17 02:46:11,909 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 1757 transitions. Word has length 96 [2024-11-17 02:46:11,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:11,909 INFO L471 AbstractCegarLoop]: Abstraction has 1396 states and 1757 transitions. [2024-11-17 02:46:11,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.666666666666666) internal successors, (94), 6 states have internal predecessors, (94), 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-17 02:46:11,909 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 1757 transitions. [2024-11-17 02:46:11,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-17 02:46:11,911 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:11,911 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:46:11,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-17 02:46:11,912 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr312REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:46:11,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:11,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1280361511, now seen corresponding path program 1 times [2024-11-17 02:46:11,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:11,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277508980] [2024-11-17 02:46:11,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:11,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:11,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:12,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 02:46:12,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:12,450 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-17 02:46:12,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:12,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277508980] [2024-11-17 02:46:12,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277508980] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:46:12,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904657162] [2024-11-17 02:46:12,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:12,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:46:12,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:46:12,453 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-17 02:46:12,454 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-17 02:46:12,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:12,672 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-17 02:46:12,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:46:12,854 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-17 02:46:12,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-17 02:46:12,895 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-17 02:46:12,986 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-17 02:46:13,173 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:46:13,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-17 02:46:13,214 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-17 02:46:13,252 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-17 02:46:13,253 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:46:13,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904657162] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:46:13,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:46:13,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2024-11-17 02:46:13,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811281225] [2024-11-17 02:46:13,321 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:46:13,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-17 02:46:13,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:13,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-17 02:46:13,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=319, Unknown=7, NotChecked=0, Total=380 [2024-11-17 02:46:13,323 INFO L87 Difference]: Start difference. First operand 1396 states and 1757 transitions. Second operand has 19 states, 16 states have (on average 7.625) internal successors, (122), 18 states have internal predecessors, (122), 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-17 02:46:15,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:15,348 INFO L93 Difference]: Finished difference Result 1403 states and 1763 transitions. [2024-11-17 02:46:15,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 02:46:15,349 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 7.625) internal successors, (122), 18 states have internal predecessors, (122), 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 97 [2024-11-17 02:46:15,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:15,356 INFO L225 Difference]: With dead ends: 1403 [2024-11-17 02:46:15,356 INFO L226 Difference]: Without dead ends: 1403 [2024-11-17 02:46:15,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=505, Unknown=8, NotChecked=0, Total=600 [2024-11-17 02:46:15,357 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 722 mSDsluCounter, 5634 mSDsCounter, 0 mSdLazyCounter, 4305 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 6118 SdHoareTripleChecker+Invalid, 4321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 4305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:15,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 6118 Invalid, 4321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 4305 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-17 02:46:15,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2024-11-17 02:46:15,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1400. [2024-11-17 02:46:15,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 1166 states have (on average 1.4965694682675814) internal successors, (1745), 1390 states have internal predecessors, (1745), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-17 02:46:15,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1757 transitions. [2024-11-17 02:46:15,380 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 1757 transitions. Word has length 97 [2024-11-17 02:46:15,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:15,380 INFO L471 AbstractCegarLoop]: Abstraction has 1400 states and 1757 transitions. [2024-11-17 02:46:15,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 7.625) internal successors, (122), 18 states have internal predecessors, (122), 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-17 02:46:15,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1757 transitions. [2024-11-17 02:46:15,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-17 02:46:15,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:15,381 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:46:15,401 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-17 02:46:15,582 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,SelfDestructingSolverStorable22 [2024-11-17 02:46:15,583 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr313REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:46:15,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:15,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1280361512, now seen corresponding path program 1 times [2024-11-17 02:46:15,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:15,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109594134] [2024-11-17 02:46:15,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:15,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:16,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 02:46:16,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:16,330 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-17 02:46:16,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:16,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109594134] [2024-11-17 02:46:16,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109594134] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:46:16,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863359780] [2024-11-17 02:46:16,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:16,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:46:16,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:46:16,334 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-17 02:46:16,336 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-17 02:46:16,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:16,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-17 02:46:16,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:46:16,663 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-17 02:46:16,671 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:46:16,671 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-17 02:46:16,701 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-17 02:46:16,705 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-17 02:46:16,792 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-17 02:46:16,797 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-17 02:46:16,914 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:46:16,914 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-17 02:46:16,919 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-17 02:46:16,961 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-17 02:46:16,967 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-17 02:46:16,991 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-17 02:46:16,991 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:46:17,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863359780] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:46:17,135 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:46:17,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2024-11-17 02:46:17,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863579777] [2024-11-17 02:46:17,136 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:46:17,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-17 02:46:17,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:17,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-17 02:46:17,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=390, Unknown=7, NotChecked=0, Total=462 [2024-11-17 02:46:17,139 INFO L87 Difference]: Start difference. First operand 1400 states and 1757 transitions. Second operand has 19 states, 16 states have (on average 7.625) internal successors, (122), 18 states have internal predecessors, (122), 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-17 02:46:19,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:19,378 INFO L93 Difference]: Finished difference Result 1402 states and 1761 transitions. [2024-11-17 02:46:19,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 02:46:19,379 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 7.625) internal successors, (122), 18 states have internal predecessors, (122), 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 97 [2024-11-17 02:46:19,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:19,382 INFO L225 Difference]: With dead ends: 1402 [2024-11-17 02:46:19,382 INFO L226 Difference]: Without dead ends: 1402 [2024-11-17 02:46:19,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 91 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=589, Unknown=7, NotChecked=0, Total=702 [2024-11-17 02:46:19,383 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 727 mSDsluCounter, 4470 mSDsCounter, 0 mSdLazyCounter, 4673 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 4957 SdHoareTripleChecker+Invalid, 4694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:19,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 4957 Invalid, 4694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4673 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-17 02:46:19,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2024-11-17 02:46:19,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 1390. [2024-11-17 02:46:19,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1158 states have (on average 1.4974093264248705) internal successors, (1734), 1382 states have internal predecessors, (1734), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 02:46:19,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 1744 transitions. [2024-11-17 02:46:19,401 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 1744 transitions. Word has length 97 [2024-11-17 02:46:19,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:19,401 INFO L471 AbstractCegarLoop]: Abstraction has 1390 states and 1744 transitions. [2024-11-17 02:46:19,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 7.625) internal successors, (122), 18 states have internal predecessors, (122), 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-17 02:46:19,402 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 1744 transitions. [2024-11-17 02:46:19,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-17 02:46:19,402 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:19,403 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-17 02:46:19,422 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-17 02:46:19,606 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,SelfDestructingSolverStorable23 [2024-11-17 02:46:19,607 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:46:19,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:19,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1751802444, now seen corresponding path program 1 times [2024-11-17 02:46:19,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:19,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543937365] [2024-11-17 02:46:19,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:19,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:20,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 02:46:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:20,150 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-17 02:46:20,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:20,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543937365] [2024-11-17 02:46:20,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543937365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:20,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:20,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-17 02:46:20,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956056250] [2024-11-17 02:46:20,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:20,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 02:46:20,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:20,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 02:46:20,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-17 02:46:20,152 INFO L87 Difference]: Start difference. First operand 1390 states and 1744 transitions. Second operand has 14 states, 12 states have (on average 8.083333333333334) internal successors, (97), 13 states have internal predecessors, (97), 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-17 02:46:21,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:21,818 INFO L93 Difference]: Finished difference Result 1409 states and 1769 transitions. [2024-11-17 02:46:21,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 02:46:21,819 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.083333333333334) internal successors, (97), 13 states have internal predecessors, (97), 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 99 [2024-11-17 02:46:21,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:21,822 INFO L225 Difference]: With dead ends: 1409 [2024-11-17 02:46:21,822 INFO L226 Difference]: Without dead ends: 1409 [2024-11-17 02:46:21,823 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-17 02:46:21,827 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 724 mSDsluCounter, 4692 mSDsCounter, 0 mSdLazyCounter, 3667 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 5176 SdHoareTripleChecker+Invalid, 3679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 3667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:21,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 5176 Invalid, 3679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 3667 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-17 02:46:21,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2024-11-17 02:46:21,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1405. [2024-11-17 02:46:21,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 1172 states have (on average 1.4940273037542662) internal successors, (1751), 1395 states have internal predecessors, (1751), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-17 02:46:21,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 1763 transitions. [2024-11-17 02:46:21,848 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 1763 transitions. Word has length 99 [2024-11-17 02:46:21,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:21,848 INFO L471 AbstractCegarLoop]: Abstraction has 1405 states and 1763 transitions. [2024-11-17 02:46:21,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.083333333333334) internal successors, (97), 13 states have internal predecessors, (97), 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-17 02:46:21,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 1763 transitions. [2024-11-17 02:46:21,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-17 02:46:21,850 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:21,850 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 02:46:21,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-17 02:46:21,850 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr309REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:46:21,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:21,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1751802443, now seen corresponding path program 1 times [2024-11-17 02:46:21,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:21,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011001498] [2024-11-17 02:46:21,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:21,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:22,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 02:46:22,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:22,586 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-17 02:46:22,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:22,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011001498] [2024-11-17 02:46:22,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011001498] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:22,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:22,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-17 02:46:22,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497119877] [2024-11-17 02:46:22,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:22,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-17 02:46:22,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:22,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-17 02:46:22,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-17 02:46:22,589 INFO L87 Difference]: Start difference. First operand 1405 states and 1763 transitions. Second operand has 12 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 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-17 02:46:24,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:24,238 INFO L93 Difference]: Finished difference Result 1408 states and 1767 transitions. [2024-11-17 02:46:24,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-17 02:46:24,238 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 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 99 [2024-11-17 02:46:24,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:24,241 INFO L225 Difference]: With dead ends: 1408 [2024-11-17 02:46:24,241 INFO L226 Difference]: Without dead ends: 1408 [2024-11-17 02:46:24,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-17 02:46:24,242 INFO L432 NwaCegarLoop]: 488 mSDtfsCounter, 741 mSDsluCounter, 3280 mSDsCounter, 0 mSdLazyCounter, 3476 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 3768 SdHoareTripleChecker+Invalid, 3487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:24,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [745 Valid, 3768 Invalid, 3487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3476 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-17 02:46:24,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2024-11-17 02:46:24,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 1405. [2024-11-17 02:46:24,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 1172 states have (on average 1.492320819112628) internal successors, (1749), 1395 states have internal predecessors, (1749), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-17 02:46:24,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 1761 transitions. [2024-11-17 02:46:24,261 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 1761 transitions. Word has length 99 [2024-11-17 02:46:24,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:24,261 INFO L471 AbstractCegarLoop]: Abstraction has 1405 states and 1761 transitions. [2024-11-17 02:46:24,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.818181818181818) internal successors, (97), 11 states have internal predecessors, (97), 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-17 02:46:24,262 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 1761 transitions. [2024-11-17 02:46:24,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-17 02:46:24,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:24,263 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:46:24,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-17 02:46:24,263 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr308REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:46:24,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:24,264 INFO L85 PathProgramCache]: Analyzing trace with hash -353897904, now seen corresponding path program 1 times [2024-11-17 02:46:24,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:24,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318951593] [2024-11-17 02:46:24,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:24,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:24,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 02:46:24,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:24,803 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-17 02:46:24,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:24,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318951593] [2024-11-17 02:46:24,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318951593] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:46:24,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047528329] [2024-11-17 02:46:24,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:24,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:46:24,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:46:24,806 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-17 02:46:24,808 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-17 02:46:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:25,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-17 02:46:25,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:46:25,079 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-17 02:46:25,192 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-17 02:46:25,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-17 02:46:25,223 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-17 02:46:25,296 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-17 02:46:25,429 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:46:25,429 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-17 02:46:25,516 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:46:25,516 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-17 02:46:25,531 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-17 02:46:25,563 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-17 02:46:25,563 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:46:25,603 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1083 (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_1083) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-17 02:46:25,635 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1086 (Array Int Int)) (v_ArrVal_1083 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1086))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1083)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-17 02:46:25,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047528329] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:46:25,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:46:25,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2024-11-17 02:46:25,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444541976] [2024-11-17 02:46:25,639 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:46:25,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-17 02:46:25,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:25,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-17 02:46:25,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=432, Unknown=6, NotChecked=86, Total=600 [2024-11-17 02:46:25,641 INFO L87 Difference]: Start difference. First operand 1405 states and 1761 transitions. Second operand has 22 states, 19 states have (on average 8.31578947368421) internal successors, (158), 21 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-17 02:46:27,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:27,981 INFO L93 Difference]: Finished difference Result 1407 states and 1765 transitions. [2024-11-17 02:46:27,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 02:46:27,981 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.31578947368421) internal successors, (158), 21 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 100 [2024-11-17 02:46:27,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:27,983 INFO L225 Difference]: With dead ends: 1407 [2024-11-17 02:46:27,983 INFO L226 Difference]: Without dead ends: 1407 [2024-11-17 02:46:27,983 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=601, Unknown=6, NotChecked=102, Total=812 [2024-11-17 02:46:27,984 INFO L432 NwaCegarLoop]: 483 mSDtfsCounter, 705 mSDsluCounter, 7505 mSDsCounter, 0 mSdLazyCounter, 5471 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 7988 SdHoareTripleChecker+Invalid, 5483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 5471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:27,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 7988 Invalid, 5483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 5471 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-17 02:46:27,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2024-11-17 02:46:27,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1404. [2024-11-17 02:46:28,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 1172 states have (on average 1.4906143344709897) internal successors, (1747), 1394 states have internal predecessors, (1747), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-17 02:46:28,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 1759 transitions. [2024-11-17 02:46:28,002 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 1759 transitions. Word has length 100 [2024-11-17 02:46:28,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:28,003 INFO L471 AbstractCegarLoop]: Abstraction has 1404 states and 1759 transitions. [2024-11-17 02:46:28,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.31578947368421) internal successors, (158), 21 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-17 02:46:28,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1759 transitions. [2024-11-17 02:46:28,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-17 02:46:28,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:28,004 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] [2024-11-17 02:46:28,023 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-17 02:46:28,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:46:28,205 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr309REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:46:28,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:28,205 INFO L85 PathProgramCache]: Analyzing trace with hash -353897903, now seen corresponding path program 1 times [2024-11-17 02:46:28,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:28,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111563272] [2024-11-17 02:46:28,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:28,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:28,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:28,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 02:46:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:29,022 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-17 02:46:29,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:29,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111563272] [2024-11-17 02:46:29,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111563272] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:46:29,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630067103] [2024-11-17 02:46:29,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:29,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:46:29,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:46:29,024 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-17 02:46:29,025 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-17 02:46:29,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:29,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-17 02:46:29,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:46:29,266 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-17 02:46:29,387 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:46:29,388 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-17 02:46:29,393 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-17 02:46:29,418 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-17 02:46:29,423 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-17 02:46:29,499 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-17 02:46:29,504 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-17 02:46:29,602 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:46:29,602 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-17 02:46:29,607 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-17 02:46:29,684 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:46:29,684 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-17 02:46:29,691 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-17 02:46:29,707 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-17 02:46:29,711 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-17 02:46:29,729 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-17 02:46:29,729 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:46:29,790 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1243 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1244 (Array Int Int)) (v_ArrVal_1243 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1244) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-17 02:46:29,798 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_1243 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_1244 (Array Int Int)) (v_ArrVal_1243 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1244) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-17 02:46:29,837 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1249 (Array Int Int)) (v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1250 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1249) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1250) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1249 (Array Int Int)) (v_ArrVal_1244 (Array Int Int)) (v_ArrVal_1243 (Array Int Int)) (v_ArrVal_1250 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1250))) (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~mem54#1.base| v_ArrVal_1249) .cse1 v_ArrVal_1243) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1244) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-17 02:46:29,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630067103] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:46:29,840 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:46:29,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2024-11-17 02:46:29,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250984578] [2024-11-17 02:46:29,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:46:29,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-17 02:46:29,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:29,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-17 02:46:29,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=438, Unknown=3, NotChecked=132, Total=650 [2024-11-17 02:46:29,841 INFO L87 Difference]: Start difference. First operand 1404 states and 1759 transitions. Second operand has 21 states, 18 states have (on average 8.777777777777779) internal successors, (158), 20 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-17 02:46:31,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:31,761 INFO L93 Difference]: Finished difference Result 1406 states and 1763 transitions. [2024-11-17 02:46:31,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 02:46:31,762 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 8.777777777777779) internal successors, (158), 20 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 100 [2024-11-17 02:46:31,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:31,764 INFO L225 Difference]: With dead ends: 1406 [2024-11-17 02:46:31,764 INFO L226 Difference]: Without dead ends: 1406 [2024-11-17 02:46:31,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=694, Unknown=3, NotChecked=168, Total=992 [2024-11-17 02:46:31,766 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 711 mSDsluCounter, 3996 mSDsCounter, 0 mSdLazyCounter, 4347 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 4482 SdHoareTripleChecker+Invalid, 4366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:31,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 4482 Invalid, 4366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4347 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-17 02:46:31,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2024-11-17 02:46:31,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1388. [2024-11-17 02:46:31,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1388 states, 1158 states have (on average 1.4939550949913645) internal successors, (1730), 1380 states have internal predecessors, (1730), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 02:46:31,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1388 states to 1388 states and 1740 transitions. [2024-11-17 02:46:31,781 INFO L78 Accepts]: Start accepts. Automaton has 1388 states and 1740 transitions. Word has length 100 [2024-11-17 02:46:31,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:31,782 INFO L471 AbstractCegarLoop]: Abstraction has 1388 states and 1740 transitions. [2024-11-17 02:46:31,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 8.777777777777779) internal successors, (158), 20 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-17 02:46:31,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1388 states and 1740 transitions. [2024-11-17 02:46:31,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-17 02:46:31,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:31,783 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-17 02:46:31,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-17 02:46:31,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-17 02:46:31,984 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr304REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:46:31,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:31,985 INFO L85 PathProgramCache]: Analyzing trace with hash 201881212, now seen corresponding path program 1 times [2024-11-17 02:46:31,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:31,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871017119] [2024-11-17 02:46:31,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:31,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:32,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 02:46:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:32,497 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-17 02:46:32,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:32,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871017119] [2024-11-17 02:46:32,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871017119] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:32,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:32,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-17 02:46:32,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165118335] [2024-11-17 02:46:32,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:32,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 02:46:32,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:32,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 02:46:32,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-17 02:46:32,500 INFO L87 Difference]: Start difference. First operand 1388 states and 1740 transitions. Second operand has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 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-17 02:46:33,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:33,685 INFO L93 Difference]: Finished difference Result 1413 states and 1771 transitions. [2024-11-17 02:46:33,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 02:46:33,686 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 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-17 02:46:33,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:33,688 INFO L225 Difference]: With dead ends: 1413 [2024-11-17 02:46:33,688 INFO L226 Difference]: Without dead ends: 1413 [2024-11-17 02:46:33,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2024-11-17 02:46:33,689 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 745 mSDsluCounter, 3751 mSDsCounter, 0 mSdLazyCounter, 2940 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 4237 SdHoareTripleChecker+Invalid, 2953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:33,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 4237 Invalid, 2953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2940 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-17 02:46:33,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2024-11-17 02:46:33,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1409. [2024-11-17 02:46:33,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1409 states, 1178 states have (on average 1.4881154499151104) internal successors, (1753), 1399 states have internal predecessors, (1753), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-17 02:46:33,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1409 states and 1765 transitions. [2024-11-17 02:46:33,703 INFO L78 Accepts]: Start accepts. Automaton has 1409 states and 1765 transitions. Word has length 102 [2024-11-17 02:46:33,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:33,704 INFO L471 AbstractCegarLoop]: Abstraction has 1409 states and 1765 transitions. [2024-11-17 02:46:33,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 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-17 02:46:33,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 1765 transitions. [2024-11-17 02:46:33,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-17 02:46:33,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:33,705 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-17 02:46:33,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-17 02:46:33,705 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr305REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:46:33,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:33,706 INFO L85 PathProgramCache]: Analyzing trace with hash 201881213, now seen corresponding path program 1 times [2024-11-17 02:46:33,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:33,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023432904] [2024-11-17 02:46:33,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:33,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:34,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 02:46:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:34,398 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-17 02:46:34,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:34,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023432904] [2024-11-17 02:46:34,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023432904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:34,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:34,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-17 02:46:34,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199596494] [2024-11-17 02:46:34,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:34,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-17 02:46:34,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:34,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-17 02:46:34,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-17 02:46:34,400 INFO L87 Difference]: Start difference. First operand 1409 states and 1765 transitions. Second operand has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 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-17 02:46:35,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:35,739 INFO L93 Difference]: Finished difference Result 1412 states and 1769 transitions. [2024-11-17 02:46:35,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-17 02:46:35,740 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 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-17 02:46:35,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:35,742 INFO L225 Difference]: With dead ends: 1412 [2024-11-17 02:46:35,742 INFO L226 Difference]: Without dead ends: 1412 [2024-11-17 02:46:35,742 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-17 02:46:35,742 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 742 mSDsluCounter, 2913 mSDsCounter, 0 mSdLazyCounter, 3048 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 3400 SdHoareTripleChecker+Invalid, 3059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:35,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 3400 Invalid, 3059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3048 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-17 02:46:35,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2024-11-17 02:46:35,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1409. [2024-11-17 02:46:35,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1409 states, 1178 states have (on average 1.4864176570458405) internal successors, (1751), 1399 states have internal predecessors, (1751), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-17 02:46:35,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1409 states to 1409 states and 1763 transitions. [2024-11-17 02:46:35,754 INFO L78 Accepts]: Start accepts. Automaton has 1409 states and 1763 transitions. Word has length 102 [2024-11-17 02:46:35,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:35,754 INFO L471 AbstractCegarLoop]: Abstraction has 1409 states and 1763 transitions. [2024-11-17 02:46:35,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 12 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-17 02:46:35,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1409 states and 1763 transitions. [2024-11-17 02:46:35,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-17 02:46:35,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:35,755 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:46:35,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-17 02:46:35,756 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr304REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:46:35,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:35,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1173130336, now seen corresponding path program 1 times [2024-11-17 02:46:35,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:35,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879825432] [2024-11-17 02:46:35,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:35,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:35,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:36,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 02:46:36,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:36,344 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-17 02:46:36,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:36,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879825432] [2024-11-17 02:46:36,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879825432] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:46:36,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574786537] [2024-11-17 02:46:36,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:36,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:46:36,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:46:36,346 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-17 02:46:36,346 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-17 02:46:36,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:36,573 INFO L255 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-17 02:46:36,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:46:36,580 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-17 02:46:36,668 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-17 02:46:36,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-17 02:46:36,694 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-17 02:46:36,765 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-17 02:46:36,881 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:46:36,882 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-17 02:46:36,971 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:46:36,973 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-17 02:46:37,024 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:46:37,024 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-17 02:46:37,035 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-17 02:46:37,060 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-17 02:46:37,060 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:46:37,097 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1562 (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_1562) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-17 02:46:37,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574786537] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:46:37,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:46:37,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2024-11-17 02:46:37,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842709110] [2024-11-17 02:46:37,250 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:46:37,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-17 02:46:37,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:37,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-17 02:46:37,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=615, Unknown=43, NotChecked=52, Total=812 [2024-11-17 02:46:37,252 INFO L87 Difference]: Start difference. First operand 1409 states and 1763 transitions. Second operand has 24 states, 21 states have (on average 7.809523809523809) internal successors, (164), 23 states have internal predecessors, (164), 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-17 02:46:39,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:39,219 INFO L93 Difference]: Finished difference Result 1411 states and 1767 transitions. [2024-11-17 02:46:39,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 02:46:39,219 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.809523809523809) internal successors, (164), 23 states have internal predecessors, (164), 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 103 [2024-11-17 02:46:39,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:39,222 INFO L225 Difference]: With dead ends: 1411 [2024-11-17 02:46:39,222 INFO L226 Difference]: Without dead ends: 1411 [2024-11-17 02:46:39,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=130, Invalid=820, Unknown=46, NotChecked=60, Total=1056 [2024-11-17 02:46:39,223 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 702 mSDsluCounter, 5646 mSDsCounter, 0 mSdLazyCounter, 4273 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 6128 SdHoareTripleChecker+Invalid, 4287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 4273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:39,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 6128 Invalid, 4287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 4273 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-17 02:46:39,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2024-11-17 02:46:39,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1408. [2024-11-17 02:46:39,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1408 states, 1178 states have (on average 1.4847198641765704) internal successors, (1749), 1398 states have internal predecessors, (1749), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-17 02:46:39,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1408 states to 1408 states and 1761 transitions. [2024-11-17 02:46:39,240 INFO L78 Accepts]: Start accepts. Automaton has 1408 states and 1761 transitions. Word has length 103 [2024-11-17 02:46:39,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:39,241 INFO L471 AbstractCegarLoop]: Abstraction has 1408 states and 1761 transitions. [2024-11-17 02:46:39,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.809523809523809) internal successors, (164), 23 states have internal predecessors, (164), 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-17 02:46:39,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1408 states and 1761 transitions. [2024-11-17 02:46:39,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-17 02:46:39,242 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:39,242 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:46:39,262 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-17 02:46:39,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:46:39,442 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr305REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:46:39,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:39,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1173130337, now seen corresponding path program 1 times [2024-11-17 02:46:39,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:39,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611366918] [2024-11-17 02:46:39,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:39,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:39,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:40,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 02:46:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:40,231 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-17 02:46:40,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:40,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611366918] [2024-11-17 02:46:40,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611366918] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:46:40,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564639861] [2024-11-17 02:46:40,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:40,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:46:40,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:46:40,233 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-17 02:46:40,235 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-17 02:46:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:40,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-17 02:46:40,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:46:40,514 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-17 02:46:40,607 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-17 02:46:40,614 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:46:40,614 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-17 02:46:40,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-17 02:46:40,648 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-17 02:46:40,716 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-17 02:46:40,719 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-17 02:46:40,810 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:46:40,810 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-17 02:46:40,814 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-17 02:46:40,888 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:46:40,888 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-17 02:46:40,893 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-17 02:46:40,957 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:46:40,958 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-17 02:46:40,963 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 41 treesize of output 22 [2024-11-17 02:46:41,000 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-17 02:46:41,005 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 30 treesize of output 12 [2024-11-17 02:46:41,030 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-17 02:46:41,030 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:46:41,488 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1734 (Array Int Int)) (v_ArrVal_1743 (Array Int Int)) (v_ArrVal_1742 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1743))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1742) .cse5 v_ArrVal_1734))) (or (< (+ 4 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) 0) (forall ((v_ArrVal_1736 (Array Int Int)) (v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1737 (Array Int Int))) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_1735))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 12 (select (select (store .cse0 .cse2 v_ArrVal_1737) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1736) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) (forall ((v_ArrVal_1734 (Array Int Int)) (v_ArrVal_1743 (Array Int Int)) (v_ArrVal_1742 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1743))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1742) .cse8 v_ArrVal_1734))) (or (< (+ 4 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) 0) (forall ((v_ArrVal_1735 (Array Int Int)) (v_ArrVal_1737 (Array Int Int))) (<= 0 (+ 8 (select (select (store .cse6 (select (select (store .cse7 .cse8 v_ArrVal_1735) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1737) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) is different from false [2024-11-17 02:46:41,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564639861] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:46:41,491 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:46:41,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2024-11-17 02:46:41,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801144502] [2024-11-17 02:46:41,492 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:46:41,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-17 02:46:41,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:41,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-17 02:46:41,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=745, Unknown=15, NotChecked=56, Total=930 [2024-11-17 02:46:41,495 INFO L87 Difference]: Start difference. First operand 1408 states and 1761 transitions. Second operand has 24 states, 21 states have (on average 7.809523809523809) internal successors, (164), 23 states have internal predecessors, (164), 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-17 02:46:43,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:43,202 INFO L93 Difference]: Finished difference Result 1410 states and 1765 transitions. [2024-11-17 02:46:43,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-17 02:46:43,203 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.809523809523809) internal successors, (164), 23 states have internal predecessors, (164), 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 103 [2024-11-17 02:46:43,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:43,205 INFO L225 Difference]: With dead ends: 1410 [2024-11-17 02:46:43,205 INFO L226 Difference]: Without dead ends: 1410 [2024-11-17 02:46:43,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=191, Invalid=1129, Unknown=16, NotChecked=70, Total=1406 [2024-11-17 02:46:43,207 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 713 mSDsluCounter, 2814 mSDsCounter, 0 mSdLazyCounter, 3171 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 717 SdHoareTripleChecker+Valid, 3299 SdHoareTripleChecker+Invalid, 3192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 3171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:43,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [717 Valid, 3299 Invalid, 3192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 3171 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-17 02:46:43,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2024-11-17 02:46:43,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1386. [2024-11-17 02:46:43,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 1158 states have (on average 1.4905008635578583) internal successors, (1726), 1378 states have internal predecessors, (1726), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 02:46:43,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 1736 transitions. [2024-11-17 02:46:43,226 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 1736 transitions. Word has length 103 [2024-11-17 02:46:43,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:43,226 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 1736 transitions. [2024-11-17 02:46:43,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.809523809523809) internal successors, (164), 23 states have internal predecessors, (164), 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-17 02:46:43,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1736 transitions. [2024-11-17 02:46:43,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-17 02:46:43,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:43,227 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:46:43,246 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-17 02:46:43,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:46:43,428 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr300REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:46:43,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:43,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1289842061, now seen corresponding path program 1 times [2024-11-17 02:46:43,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:43,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535698514] [2024-11-17 02:46:43,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:43,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:43,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:43,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 02:46:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:43,929 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-17 02:46:43,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:43,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535698514] [2024-11-17 02:46:43,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535698514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:43,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:43,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-17 02:46:43,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877232242] [2024-11-17 02:46:43,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:43,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 02:46:43,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:43,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 02:46:43,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-17 02:46:43,931 INFO L87 Difference]: Start difference. First operand 1386 states and 1736 transitions. Second operand has 14 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 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-17 02:46:45,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:45,138 INFO L93 Difference]: Finished difference Result 1417 states and 1773 transitions. [2024-11-17 02:46:45,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-17 02:46:45,139 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 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 105 [2024-11-17 02:46:45,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:45,141 INFO L225 Difference]: With dead ends: 1417 [2024-11-17 02:46:45,142 INFO L226 Difference]: Without dead ends: 1417 [2024-11-17 02:46:45,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2024-11-17 02:46:45,142 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 750 mSDsluCounter, 3790 mSDsCounter, 0 mSdLazyCounter, 2972 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 4275 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:45,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 4275 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2972 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-17 02:46:45,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2024-11-17 02:46:45,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 1413. [2024-11-17 02:46:45,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1413 states, 1184 states have (on average 1.4822635135135136) internal successors, (1755), 1403 states have internal predecessors, (1755), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-17 02:46:45,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 1767 transitions. [2024-11-17 02:46:45,155 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 1767 transitions. Word has length 105 [2024-11-17 02:46:45,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:45,156 INFO L471 AbstractCegarLoop]: Abstraction has 1413 states and 1767 transitions. [2024-11-17 02:46:45,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 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-17 02:46:45,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 1767 transitions. [2024-11-17 02:46:45,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-17 02:46:45,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:45,157 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:46:45,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-17 02:46:45,157 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr301REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:46:45,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:45,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1289842062, now seen corresponding path program 1 times [2024-11-17 02:46:45,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:45,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828620416] [2024-11-17 02:46:45,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:45,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:45,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:45,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 02:46:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:45,957 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-17 02:46:45,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:45,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828620416] [2024-11-17 02:46:45,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828620416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:45,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:45,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-17 02:46:45,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209936999] [2024-11-17 02:46:45,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:45,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-17 02:46:45,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:45,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-17 02:46:45,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-17 02:46:45,961 INFO L87 Difference]: Start difference. First operand 1413 states and 1767 transitions. Second operand has 14 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 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-17 02:46:47,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:47,478 INFO L93 Difference]: Finished difference Result 1416 states and 1771 transitions. [2024-11-17 02:46:47,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-17 02:46:47,479 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 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 105 [2024-11-17 02:46:47,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:47,482 INFO L225 Difference]: With dead ends: 1416 [2024-11-17 02:46:47,483 INFO L226 Difference]: Without dead ends: 1416 [2024-11-17 02:46:47,483 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-17 02:46:47,484 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 743 mSDsluCounter, 2806 mSDsCounter, 0 mSdLazyCounter, 3151 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 747 SdHoareTripleChecker+Valid, 3292 SdHoareTripleChecker+Invalid, 3164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:47,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [747 Valid, 3292 Invalid, 3164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3151 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-17 02:46:47,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2024-11-17 02:46:47,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 1413. [2024-11-17 02:46:47,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1413 states, 1184 states have (on average 1.4805743243243243) internal successors, (1753), 1403 states have internal predecessors, (1753), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-17 02:46:47,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 1765 transitions. [2024-11-17 02:46:47,499 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 1765 transitions. Word has length 105 [2024-11-17 02:46:47,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:47,499 INFO L471 AbstractCegarLoop]: Abstraction has 1413 states and 1765 transitions. [2024-11-17 02:46:47,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.923076923076923) internal successors, (103), 13 states have internal predecessors, (103), 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-17 02:46:47,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 1765 transitions. [2024-11-17 02:46:47,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-17 02:46:47,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:47,500 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:46:47,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-17 02:46:47,500 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr300REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:46:47,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:47,501 INFO L85 PathProgramCache]: Analyzing trace with hash 577821993, now seen corresponding path program 1 times [2024-11-17 02:46:47,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:47,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878265731] [2024-11-17 02:46:47,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:47,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:47,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:48,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 02:46:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:48,166 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-17 02:46:48,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:48,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878265731] [2024-11-17 02:46:48,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878265731] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:46:48,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491906257] [2024-11-17 02:46:48,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:48,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:46:48,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:46:48,168 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-17 02:46:48,168 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-17 02:46:48,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:48,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-17 02:46:48,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:46:48,406 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-17 02:46:48,493 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-17 02:46:48,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-17 02:46:48,516 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-17 02:46:48,575 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-17 02:46:48,711 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:46:48,711 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-17 02:46:48,790 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:46:48,791 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-17 02:46:48,835 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:46:48,835 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-17 02:46:48,882 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:46:48,882 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-17 02:46:48,892 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-17 02:46:48,917 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-17 02:46:48,917 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:46:48,925 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2080 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem58#1.base| v_ArrVal_2080) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-17 02:46:48,953 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2079 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2079))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2080)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-17 02:46:49,035 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2079 (Array Int Int)) (v_ArrVal_2078 (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| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2078))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2079)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2080)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-17 02:46:49,055 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2083 (Array Int Int)) (v_ArrVal_2080 (Array Int Int)) (v_ArrVal_2079 (Array Int Int)) (v_ArrVal_2078 (Array Int Int))) (= (select |c_#valid| (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~mem54#1.base| v_ArrVal_2083))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2078)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2079)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2080)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-17 02:46:49,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491906257] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:46:49,056 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:46:49,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2024-11-17 02:46:49,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920878846] [2024-11-17 02:46:49,056 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:46:49,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-17 02:46:49,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:49,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-17 02:46:49,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=675, Unknown=27, NotChecked=228, Total=1056 [2024-11-17 02:46:49,058 INFO L87 Difference]: Start difference. First operand 1413 states and 1765 transitions. Second operand has 26 states, 23 states have (on average 7.391304347826087) internal successors, (170), 25 states have internal predecessors, (170), 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-17 02:46:51,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:51,214 INFO L93 Difference]: Finished difference Result 1415 states and 1769 transitions. [2024-11-17 02:46:51,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-17 02:46:51,215 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 7.391304347826087) internal successors, (170), 25 states have internal predecessors, (170), 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 106 [2024-11-17 02:46:51,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:51,216 INFO L225 Difference]: With dead ends: 1415 [2024-11-17 02:46:51,217 INFO L226 Difference]: Without dead ends: 1415 [2024-11-17 02:46:51,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=155, Invalid=889, Unknown=28, NotChecked=260, Total=1332 [2024-11-17 02:46:51,217 INFO L432 NwaCegarLoop]: 481 mSDtfsCounter, 699 mSDsluCounter, 6086 mSDsCounter, 0 mSdLazyCounter, 4661 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 6567 SdHoareTripleChecker+Invalid, 4674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 4661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:51,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 6567 Invalid, 4674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 4661 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-17 02:46:51,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2024-11-17 02:46:51,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1412. [2024-11-17 02:46:51,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1412 states, 1184 states have (on average 1.478885135135135) internal successors, (1751), 1402 states have internal predecessors, (1751), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-17 02:46:51,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 1763 transitions. [2024-11-17 02:46:51,227 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 1763 transitions. Word has length 106 [2024-11-17 02:46:51,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:51,227 INFO L471 AbstractCegarLoop]: Abstraction has 1412 states and 1763 transitions. [2024-11-17 02:46:51,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 7.391304347826087) internal successors, (170), 25 states have internal predecessors, (170), 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-17 02:46:51,227 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 1763 transitions. [2024-11-17 02:46:51,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-17 02:46:51,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:51,228 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:46:51,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-17 02:46:51,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:46:51,429 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr301REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:46:51,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:51,430 INFO L85 PathProgramCache]: Analyzing trace with hash 577821994, now seen corresponding path program 1 times [2024-11-17 02:46:51,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:51,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51089644] [2024-11-17 02:46:51,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:51,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:51,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:52,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 02:46:52,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:52,374 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-17 02:46:52,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:52,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51089644] [2024-11-17 02:46:52,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51089644] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:46:52,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31571947] [2024-11-17 02:46:52,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:52,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:46:52,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:46:52,377 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-17 02:46:52,379 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-17 02:46:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:52,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 530 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-17 02:46:52,683 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:46:52,687 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-17 02:46:52,782 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-17 02:46:52,787 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-17 02:46:52,787 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-17 02:46:52,809 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-17 02:46:52,813 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-17 02:46:52,878 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-17 02:46:52,882 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-17 02:46:52,965 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:46:52,965 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-17 02:46:52,973 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-17 02:46:53,052 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:46:53,053 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-17 02:46:53,057 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-17 02:46:53,100 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:46:53,100 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-17 02:46:53,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-17 02:46:53,153 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:46:53,154 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-17 02:46:53,157 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-17 02:46:53,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 31 treesize of output 13 [2024-11-17 02:46:53,172 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-17 02:46:53,187 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-17 02:46:53,188 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:46:53,329 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2269 (Array Int Int)) (v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2266 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2266))) (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~mem57#1.base| v_ArrVal_2267) .cse0 v_ArrVal_2268) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2269) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2266 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2267) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2266) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2268) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2024-11-17 02:46:53,338 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_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2266 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2267) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2266) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2268) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (forall ((v_ArrVal_2269 (Array Int Int)) (v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2266 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2266))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2267) .cse2 v_ArrVal_2268) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_2269) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))) is different from false [2024-11-17 02:46:53,357 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2269 (Array Int Int)) (v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2266 (Array Int Int)) (v_ArrVal_2265 (Array Int Int)) (v_ArrVal_2264 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2265))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2266))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2264) .cse0 v_ArrVal_2267) .cse1 v_ArrVal_2268) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2269) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2266 (Array Int Int)) (v_ArrVal_2265 (Array Int Int)) (v_ArrVal_2264 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2265))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2264) .cse5 v_ArrVal_2267) (select (select (store .cse6 .cse5 v_ArrVal_2266) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2268))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))))) is different from false [2024-11-17 02:46:53,378 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))) (and (forall ((v_ArrVal_2269 (Array Int Int)) (v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2266 (Array Int Int)) (v_ArrVal_2265 (Array Int Int)) (v_ArrVal_2264 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2265))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_2266))) (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_2264) .cse1 v_ArrVal_2267) .cse2 v_ArrVal_2268) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_2269) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))) (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2266 (Array Int Int)) (v_ArrVal_2265 (Array Int Int)) (v_ArrVal_2264 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_2265))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_2264) .cse6 v_ArrVal_2267) (select (select (store .cse7 .cse6 v_ArrVal_2266) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2268))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20)))))) is different from false [2024-11-17 02:46:53,454 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2266 (Array Int Int)) (v_ArrVal_2265 (Array Int Int)) (v_ArrVal_2275 (Array Int Int)) (v_ArrVal_2264 (Array Int Int)) (v_ArrVal_2274 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2274))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2265))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2275) .cse0 v_ArrVal_2264) .cse1 v_ArrVal_2267) (select (select (store .cse2 .cse1 v_ArrVal_2266) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2268))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((v_ArrVal_2269 (Array Int Int)) (v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int)) (v_ArrVal_2266 (Array Int Int)) (v_ArrVal_2265 (Array Int Int)) (v_ArrVal_2275 (Array Int Int)) (v_ArrVal_2264 (Array Int Int)) (v_ArrVal_2274 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2274))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2265))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2266))) (let ((.cse7 (select (select .cse8 |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~mem54#1.base| v_ArrVal_2275) .cse5 v_ArrVal_2264) .cse6 v_ArrVal_2267) .cse7 v_ArrVal_2268) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_2269) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2024-11-17 02:46:53,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31571947] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:46:53,457 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:46:53,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2024-11-17 02:46:53,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273528613] [2024-11-17 02:46:53,457 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:46:53,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-17 02:46:53,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:53,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-17 02:46:53,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=687, Unknown=29, NotChecked=290, Total=1122 [2024-11-17 02:46:53,459 INFO L87 Difference]: Start difference. First operand 1412 states and 1763 transitions. Second operand has 25 states, 22 states have (on average 7.7272727272727275) internal successors, (170), 24 states have internal predecessors, (170), 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-17 02:46:55,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:55,852 INFO L93 Difference]: Finished difference Result 1414 states and 1767 transitions. [2024-11-17 02:46:55,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-17 02:46:55,853 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 7.7272727272727275) internal successors, (170), 24 states have internal predecessors, (170), 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 106 [2024-11-17 02:46:55,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:55,854 INFO L225 Difference]: With dead ends: 1414 [2024-11-17 02:46:55,854 INFO L226 Difference]: Without dead ends: 1414 [2024-11-17 02:46:55,855 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=193, Invalid=1129, Unknown=30, NotChecked=370, Total=1722 [2024-11-17 02:46:55,855 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 708 mSDsluCounter, 4889 mSDsCounter, 0 mSdLazyCounter, 5087 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 712 SdHoareTripleChecker+Valid, 5373 SdHoareTripleChecker+Invalid, 5104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 5087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:55,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [712 Valid, 5373 Invalid, 5104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 5087 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-17 02:46:55,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2024-11-17 02:46:55,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 1384. [2024-11-17 02:46:55,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1158 states have (on average 1.4870466321243523) internal successors, (1722), 1376 states have internal predecessors, (1722), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-17 02:46:55,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 1732 transitions. [2024-11-17 02:46:55,869 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 1732 transitions. Word has length 106 [2024-11-17 02:46:55,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:55,870 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 1732 transitions. [2024-11-17 02:46:55,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 7.7272727272727275) internal successors, (170), 24 states have internal predecessors, (170), 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-17 02:46:55,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 1732 transitions. [2024-11-17 02:46:55,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-17 02:46:55,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:55,871 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:46:55,887 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-17 02:46:56,071 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,SelfDestructingSolverStorable35 [2024-11-17 02:46:56,071 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr296REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:46:56,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:56,072 INFO L85 PathProgramCache]: Analyzing trace with hash -37878649, now seen corresponding path program 1 times [2024-11-17 02:46:56,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:56,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445352850] [2024-11-17 02:46:56,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:56,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:56,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 02:46:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:56,626 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-17 02:46:56,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:56,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445352850] [2024-11-17 02:46:56,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445352850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:56,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:56,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-17 02:46:56,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046836496] [2024-11-17 02:46:56,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:56,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-17 02:46:56,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:56,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-17 02:46:56,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2024-11-17 02:46:56,629 INFO L87 Difference]: Start difference. First operand 1384 states and 1732 transitions. Second operand has 15 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 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-17 02:46:58,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:46:58,214 INFO L93 Difference]: Finished difference Result 1423 states and 1777 transitions. [2024-11-17 02:46:58,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-17 02:46:58,214 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 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 109 [2024-11-17 02:46:58,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:46:58,216 INFO L225 Difference]: With dead ends: 1423 [2024-11-17 02:46:58,216 INFO L226 Difference]: Without dead ends: 1423 [2024-11-17 02:46:58,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2024-11-17 02:46:58,217 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 754 mSDsluCounter, 4721 mSDsCounter, 0 mSdLazyCounter, 3595 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 758 SdHoareTripleChecker+Valid, 5205 SdHoareTripleChecker+Invalid, 3613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 3595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-17 02:46:58,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [758 Valid, 5205 Invalid, 3613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 3595 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-17 02:46:58,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2024-11-17 02:46:58,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 1419. [2024-11-17 02:46:58,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1419 states, 1192 states have (on average 1.4756711409395973) internal successors, (1759), 1409 states have internal predecessors, (1759), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-17 02:46:58,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 1771 transitions. [2024-11-17 02:46:58,232 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 1771 transitions. Word has length 109 [2024-11-17 02:46:58,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:46:58,232 INFO L471 AbstractCegarLoop]: Abstraction has 1419 states and 1771 transitions. [2024-11-17 02:46:58,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.642857142857143) internal successors, (107), 14 states have internal predecessors, (107), 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-17 02:46:58,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 1771 transitions. [2024-11-17 02:46:58,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-17 02:46:58,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:46:58,233 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:46:58,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-17 02:46:58,234 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr297REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:46:58,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:46:58,234 INFO L85 PathProgramCache]: Analyzing trace with hash -37878648, now seen corresponding path program 1 times [2024-11-17 02:46:58,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:46:58,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780512303] [2024-11-17 02:46:58,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:46:58,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:46:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:59,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 02:46:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:46:59,226 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-17 02:46:59,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:46:59,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780512303] [2024-11-17 02:46:59,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780512303] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-17 02:46:59,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-17 02:46:59,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-17 02:46:59,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548808141] [2024-11-17 02:46:59,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-17 02:46:59,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-17 02:46:59,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:46:59,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-17 02:46:59,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-17 02:46:59,228 INFO L87 Difference]: Start difference. First operand 1419 states and 1771 transitions. Second operand has 18 states, 16 states have (on average 6.6875) internal successors, (107), 17 states have internal predecessors, (107), 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-17 02:47:01,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-17 02:47:01,127 INFO L93 Difference]: Finished difference Result 1422 states and 1775 transitions. [2024-11-17 02:47:01,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-17 02:47:01,128 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.6875) internal successors, (107), 17 states have internal predecessors, (107), 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 109 [2024-11-17 02:47:01,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-17 02:47:01,131 INFO L225 Difference]: With dead ends: 1422 [2024-11-17 02:47:01,131 INFO L226 Difference]: Without dead ends: 1422 [2024-11-17 02:47:01,131 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=682, Unknown=0, NotChecked=0, Total=812 [2024-11-17 02:47:01,132 INFO L432 NwaCegarLoop]: 482 mSDtfsCounter, 728 mSDsluCounter, 3638 mSDsCounter, 0 mSdLazyCounter, 3947 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 732 SdHoareTripleChecker+Valid, 4120 SdHoareTripleChecker+Invalid, 3964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 3947 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-17 02:47:01,132 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [732 Valid, 4120 Invalid, 3964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 3947 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-17 02:47:01,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2024-11-17 02:47:01,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 1419. [2024-11-17 02:47:01,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1419 states, 1192 states have (on average 1.473993288590604) internal successors, (1757), 1409 states have internal predecessors, (1757), 5 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-17 02:47:01,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1419 states to 1419 states and 1769 transitions. [2024-11-17 02:47:01,148 INFO L78 Accepts]: Start accepts. Automaton has 1419 states and 1769 transitions. Word has length 109 [2024-11-17 02:47:01,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-17 02:47:01,149 INFO L471 AbstractCegarLoop]: Abstraction has 1419 states and 1769 transitions. [2024-11-17 02:47:01,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.6875) internal successors, (107), 17 states have internal predecessors, (107), 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-17 02:47:01,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1419 states and 1769 transitions. [2024-11-17 02:47:01,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-17 02:47:01,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-17 02:47:01,150 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-17 02:47:01,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-17 02:47:01,150 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr296REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-17 02:47:01,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-17 02:47:01,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1735113181, now seen corresponding path program 1 times [2024-11-17 02:47:01,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-17 02:47:01,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865443135] [2024-11-17 02:47:01,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:01,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-17 02:47:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:01,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-17 02:47:01,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:01,902 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-17 02:47:01,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-17 02:47:01,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865443135] [2024-11-17 02:47:01,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865443135] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:47:01,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2093876945] [2024-11-17 02:47:01,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-17 02:47:01,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-17 02:47:01,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-17 02:47:01,905 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-17 02:47:01,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-17 02:47:02,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-17 02:47:02,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 567 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-17 02:47:02,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-17 02:47:02,178 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-17 02:47:02,271 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-17 02:47:02,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-17 02:47:02,301 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-17 02:47:02,376 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-17 02:47:02,492 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:02,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 42 treesize of output 41 [2024-11-17 02:47:02,560 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:02,560 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-17 02:47:02,604 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:02,604 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-17 02:47:02,651 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:02,651 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-17 02:47:02,696 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-17 02:47:02,697 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-17 02:47:02,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-17 02:47:02,757 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-17 02:47:02,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2024-11-17 02:47:02,763 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-17 02:47:02,763 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-17 02:47:03,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2093876945] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-17 02:47:03,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-17 02:47:03,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12] total 27 [2024-11-17 02:47:03,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240961715] [2024-11-17 02:47:03,535 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-17 02:47:03,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-17 02:47:03,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-17 02:47:03,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-17 02:47:03,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=1237, Unknown=50, NotChecked=0, Total=1482 [2024-11-17 02:47:03,537 INFO L87 Difference]: Start difference. First operand 1419 states and 1769 transitions. Second operand has 28 states, 25 states have (on average 7.12) internal successors, (178), 27 states have internal predecessors, (178), 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)