./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d 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_BER_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-?-c7c6ca5-m [2024-11-09 09:58:50,010 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 09:58:50,083 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 09:58:50,089 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 09:58:50,089 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 09:58:50,121 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 09:58:50,122 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 09:58:50,122 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 09:58:50,123 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 09:58:50,123 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 09:58:50,124 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 09:58:50,134 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 09:58:50,135 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 09:58:50,135 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 09:58:50,135 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 09:58:50,136 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 09:58:50,136 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 09:58:50,136 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 09:58:50,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 09:58:50,140 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 09:58:50,140 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 09:58:50,141 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 09:58:50,141 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 09:58:50,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 09:58:50,146 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 09:58:50,146 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 09:58:50,146 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 09:58:50,146 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 09:58:50,146 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 09:58:50,147 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 09:58:50,147 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 09:58:50,147 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 09:58:50,147 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 09:58:50,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 09:58:50,148 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 09:58:50,148 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 09:58:50,149 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 09:58:50,149 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 09:58:50,149 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 09:58:50,151 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 09:58:50,151 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 09:58:50,152 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 09:58:50,152 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-09 09:58:50,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 09:58:50,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 09:58:50,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 09:58:50,477 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 09:58:50,478 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 09:58:50,480 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-1.i [2024-11-09 09:58:52,077 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 09:58:52,421 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 09:58:52,422 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_nondet_test2-1.i [2024-11-09 09:58:52,463 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f617e086c/a0a21f0ec0f14f06a17921d73521379c/FLAGc0fa5d44e [2024-11-09 09:58:52,488 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f617e086c/a0a21f0ec0f14f06a17921d73521379c [2024-11-09 09:58:52,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 09:58:52,494 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 09:58:52,496 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 09:58:52,498 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 09:58:52,504 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 09:58:52,505 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:58:52" (1/1) ... [2024-11-09 09:58:52,506 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@399a8ef4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:52, skipping insertion in model container [2024-11-09 09:58:52,506 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:58:52" (1/1) ... [2024-11-09 09:58:52,580 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 09:58:53,080 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:58:53,123 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:58:53,128 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:58:53,134 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:58:53,143 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:58:53,185 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:58:53,186 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:58:53,188 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:58:53,188 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 09:58:53,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 09:58:53,211 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 09:58:53,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 09:58:53,335 INFO L204 MainTranslator]: Completed translation [2024-11-09 09:58:53,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:53 WrapperNode [2024-11-09 09:58:53,337 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 09:58:53,338 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 09:58:53,338 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 09:58:53,338 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 09:58:53,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:53" (1/1) ... [2024-11-09 09:58:53,381 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:53" (1/1) ... [2024-11-09 09:58:53,444 INFO L138 Inliner]: procedures = 207, calls = 222, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1289 [2024-11-09 09:58:53,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 09:58:53,445 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 09:58:53,446 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 09:58:53,446 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 09:58:53,464 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:53" (1/1) ... [2024-11-09 09:58:53,464 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:53" (1/1) ... [2024-11-09 09:58:53,476 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:53" (1/1) ... [2024-11-09 09:58:53,540 INFO L175 MemorySlicer]: Split 206 memory accesses to 3 slices as follows [2, 34, 170]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 46 writes are split as follows [0, 4, 42]. [2024-11-09 09:58:53,540 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:53" (1/1) ... [2024-11-09 09:58:53,541 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:53" (1/1) ... [2024-11-09 09:58:53,589 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:53" (1/1) ... [2024-11-09 09:58:53,600 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:53" (1/1) ... [2024-11-09 09:58:53,611 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:53" (1/1) ... [2024-11-09 09:58:53,617 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:53" (1/1) ... [2024-11-09 09:58:53,632 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 09:58:53,633 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 09:58:53,635 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 09:58:53,636 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 09:58:53,637 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:53" (1/1) ... [2024-11-09 09:58:53,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 09:58:53,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:58:53,674 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-09 09:58:53,680 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-09 09:58:53,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-09 09:58:53,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-09 09:58:53,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-11-09 09:58:53,751 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-09 09:58:53,751 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-09 09:58:53,751 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-11-09 09:58:53,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 09:58:53,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 09:58:53,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 09:58:53,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 09:58:53,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 09:58:53,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 09:58:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 09:58:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 09:58:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 09:58:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 09:58:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 09:58:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 09:58:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 09:58:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 09:58:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 09:58:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 09:58:53,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 09:58:53,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 09:58:53,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 09:58:53,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 09:58:53,753 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 09:58:53,987 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 09:58:53,989 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 09:58:53,993 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 09:58:54,047 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 09:58:54,069 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-09 09:58:55,902 INFO L? ?]: Removed 1028 outVars from TransFormulas that were not future-live. [2024-11-09 09:58:55,902 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 09:58:55,951 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 09:58:55,952 INFO L316 CfgBuilder]: Removed 54 assume(true) statements. [2024-11-09 09:58:55,952 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:58:55 BoogieIcfgContainer [2024-11-09 09:58:55,953 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 09:58:55,955 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 09:58:55,956 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 09:58:55,959 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 09:58:55,960 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 09:58:52" (1/3) ... [2024-11-09 09:58:55,960 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@778124e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:58:55, skipping insertion in model container [2024-11-09 09:58:55,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:58:53" (2/3) ... [2024-11-09 09:58:55,961 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@778124e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:58:55, skipping insertion in model container [2024-11-09 09:58:55,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 09:58:55" (3/3) ... [2024-11-09 09:58:55,963 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_nondet_test2-1.i [2024-11-09 09:58:55,980 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 09:58:55,980 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 420 error locations. [2024-11-09 09:58:56,061 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 09:58:56,072 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;@4aaee301, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 09:58:56,072 INFO L334 AbstractCegarLoop]: Starting to check reachability of 420 error locations. [2024-11-09 09:58:56,080 INFO L276 IsEmpty]: Start isEmpty. Operand has 1053 states, 631 states have (on average 2.0142630744849446) internal successors, (1271), 1048 states have internal predecessors, (1271), 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-09 09:58:56,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 09:58:56,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:56,088 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 09:58:56,089 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr419ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 09:58:56,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:56,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1758832, now seen corresponding path program 1 times [2024-11-09 09:58:56,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:56,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528789785] [2024-11-09 09:58:56,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:56,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:56,477 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-09 09:58:56,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:56,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528789785] [2024-11-09 09:58:56,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528789785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:58:56,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:58:56,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 09:58:56,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520830850] [2024-11-09 09:58:56,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:58:56,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 09:58:56,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:56,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 09:58:56,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 09:58:56,519 INFO L87 Difference]: Start difference. First operand has 1053 states, 631 states have (on average 2.0142630744849446) internal successors, (1271), 1048 states have internal predecessors, (1271), 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 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-09 09:58:57,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:57,536 INFO L93 Difference]: Finished difference Result 1349 states and 1602 transitions. [2024-11-09 09:58:57,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 09:58:57,540 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-09 09:58:57,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:57,569 INFO L225 Difference]: With dead ends: 1349 [2024-11-09 09:58:57,569 INFO L226 Difference]: Without dead ends: 1345 [2024-11-09 09:58:57,571 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-09 09:58:57,574 INFO L432 NwaCegarLoop]: 1098 mSDtfsCounter, 382 mSDsluCounter, 1550 mSDsCounter, 0 mSdLazyCounter, 969 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 2648 SdHoareTripleChecker+Invalid, 970 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 969 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:57,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 2648 Invalid, 970 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 969 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 09:58:57,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2024-11-09 09:58:57,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1260. [2024-11-09 09:58:57,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1260 states, 844 states have (on average 1.8815165876777251) internal successors, (1588), 1255 states have internal predecessors, (1588), 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-09 09:58:57,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 1594 transitions. [2024-11-09 09:58:57,691 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 1594 transitions. Word has length 4 [2024-11-09 09:58:57,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:57,691 INFO L471 AbstractCegarLoop]: Abstraction has 1260 states and 1594 transitions. [2024-11-09 09:58:57,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 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-09 09:58:57,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 1594 transitions. [2024-11-09 09:58:57,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 09:58:57,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:57,692 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 09:58:57,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 09:58:57,693 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 09:58:57,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:57,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1756837, now seen corresponding path program 1 times [2024-11-09 09:58:57,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:57,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452009244] [2024-11-09 09:58:57,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:57,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:57,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:57,801 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-09 09:58:57,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:57,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452009244] [2024-11-09 09:58:57,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452009244] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:58:57,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:58:57,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 09:58:57,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207589893] [2024-11-09 09:58:57,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:58:57,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 09:58:57,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:57,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 09:58:57,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 09:58:57,805 INFO L87 Difference]: Start difference. First operand 1260 states and 1594 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-09 09:58:58,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:58,376 INFO L93 Difference]: Finished difference Result 1257 states and 1586 transitions. [2024-11-09 09:58:58,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 09:58:58,377 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-09 09:58:58,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:58,382 INFO L225 Difference]: With dead ends: 1257 [2024-11-09 09:58:58,382 INFO L226 Difference]: Without dead ends: 1257 [2024-11-09 09:58:58,384 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-09 09:58:58,386 INFO L432 NwaCegarLoop]: 817 mSDtfsCounter, 1086 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1089 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:58,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1089 Valid, 861 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 09:58:58,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2024-11-09 09:58:58,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1257. [2024-11-09 09:58:58,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 852 states have (on average 1.8544600938967135) internal successors, (1580), 1252 states have internal predecessors, (1580), 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-09 09:58:58,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1586 transitions. [2024-11-09 09:58:58,420 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1586 transitions. Word has length 4 [2024-11-09 09:58:58,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:58,421 INFO L471 AbstractCegarLoop]: Abstraction has 1257 states and 1586 transitions. [2024-11-09 09:58:58,421 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-09 09:58:58,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1586 transitions. [2024-11-09 09:58:58,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-09 09:58:58,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:58,424 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-09 09:58:58,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 09:58:58,424 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 09:58:58,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:58,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1756838, now seen corresponding path program 1 times [2024-11-09 09:58:58,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:58,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872533475] [2024-11-09 09:58:58,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:58,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:58,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:58,535 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-09 09:58:58,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:58,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872533475] [2024-11-09 09:58:58,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872533475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:58:58,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:58:58,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 09:58:58,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174147608] [2024-11-09 09:58:58,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:58:58,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 09:58:58,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:58,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 09:58:58,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 09:58:58,538 INFO L87 Difference]: Start difference. First operand 1257 states and 1586 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-09 09:58:59,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:58:59,382 INFO L93 Difference]: Finished difference Result 2016 states and 2490 transitions. [2024-11-09 09:58:59,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 09:58:59,382 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-09 09:58:59,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:58:59,391 INFO L225 Difference]: With dead ends: 2016 [2024-11-09 09:58:59,391 INFO L226 Difference]: Without dead ends: 2016 [2024-11-09 09:58:59,392 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-09 09:58:59,393 INFO L432 NwaCegarLoop]: 921 mSDtfsCounter, 903 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 688 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 1693 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 688 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 09:58:59,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 1693 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 688 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 09:58:59,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2016 states. [2024-11-09 09:58:59,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2016 to 1754. [2024-11-09 09:58:59,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1754 states, 1350 states have (on average 1.8288888888888888) internal successors, (2469), 1747 states have internal predecessors, (2469), 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-09 09:58:59,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 2479 transitions. [2024-11-09 09:58:59,438 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 2479 transitions. Word has length 4 [2024-11-09 09:58:59,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:58:59,439 INFO L471 AbstractCegarLoop]: Abstraction has 1754 states and 2479 transitions. [2024-11-09 09:58:59,439 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-09 09:58:59,440 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 2479 transitions. [2024-11-09 09:58:59,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 09:58:59,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:58:59,440 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:58:59,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 09:58:59,441 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 09:58:59,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:58:59,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1599530194, now seen corresponding path program 1 times [2024-11-09 09:58:59,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:58:59,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913830242] [2024-11-09 09:58:59,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:58:59,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:58:59,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:58:59,541 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-09 09:58:59,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:58:59,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913830242] [2024-11-09 09:58:59,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913830242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:58:59,542 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:58:59,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 09:58:59,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825055663] [2024-11-09 09:58:59,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:58:59,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 09:58:59,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:58:59,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 09:58:59,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 09:58:59,544 INFO L87 Difference]: Start difference. First operand 1754 states and 2479 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 09:59:00,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:59:00,176 INFO L93 Difference]: Finished difference Result 1792 states and 2410 transitions. [2024-11-09 09:59:00,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 09:59:00,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 09:59:00,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:59:00,187 INFO L225 Difference]: With dead ends: 1792 [2024-11-09 09:59:00,188 INFO L226 Difference]: Without dead ends: 1792 [2024-11-09 09:59:00,188 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-09 09:59:00,189 INFO L432 NwaCegarLoop]: 1122 mSDtfsCounter, 1071 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 09:59:00,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1074 Valid, 1418 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 09:59:00,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1792 states. [2024-11-09 09:59:00,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1792 to 1707. [2024-11-09 09:59:00,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1350 states have (on average 1.7762962962962963) internal successors, (2398), 1700 states have internal predecessors, (2398), 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-09 09:59:00,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2408 transitions. [2024-11-09 09:59:00,231 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2408 transitions. Word has length 9 [2024-11-09 09:59:00,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:59:00,232 INFO L471 AbstractCegarLoop]: Abstraction has 1707 states and 2408 transitions. [2024-11-09 09:59:00,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 09:59:00,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2408 transitions. [2024-11-09 09:59:00,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-09 09:59:00,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:59:00,233 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:59:00,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 09:59:00,233 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 09:59:00,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:59:00,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1599530193, now seen corresponding path program 1 times [2024-11-09 09:59:00,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:59:00,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041970400] [2024-11-09 09:59:00,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:00,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:59:00,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:00,339 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-09 09:59:00,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:59:00,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041970400] [2024-11-09 09:59:00,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041970400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:59:00,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:59:00,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 09:59:00,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302846687] [2024-11-09 09:59:00,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:59:00,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 09:59:00,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:59:00,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 09:59:00,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 09:59:00,342 INFO L87 Difference]: Start difference. First operand 1707 states and 2408 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 09:59:00,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:59:00,975 INFO L93 Difference]: Finished difference Result 2000 states and 2752 transitions. [2024-11-09 09:59:00,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 09:59:00,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-09 09:59:00,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:59:00,983 INFO L225 Difference]: With dead ends: 2000 [2024-11-09 09:59:00,984 INFO L226 Difference]: Without dead ends: 2000 [2024-11-09 09:59:00,984 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-09 09:59:00,985 INFO L432 NwaCegarLoop]: 1252 mSDtfsCounter, 863 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 1666 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 09:59:00,986 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 1666 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 493 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 09:59:00,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2024-11-09 09:59:01,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 1682. [2024-11-09 09:59:01,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1682 states, 1350 states have (on average 1.74) internal successors, (2349), 1675 states have internal predecessors, (2349), 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-09 09:59:01,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1682 states to 1682 states and 2359 transitions. [2024-11-09 09:59:01,027 INFO L78 Accepts]: Start accepts. Automaton has 1682 states and 2359 transitions. Word has length 9 [2024-11-09 09:59:01,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:59:01,027 INFO L471 AbstractCegarLoop]: Abstraction has 1682 states and 2359 transitions. [2024-11-09 09:59:01,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 09:59:01,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1682 states and 2359 transitions. [2024-11-09 09:59:01,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 09:59:01,028 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:59:01,029 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:59:01,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 09:59:01,029 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr330REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 09:59:01,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:59:01,030 INFO L85 PathProgramCache]: Analyzing trace with hash -186143240, now seen corresponding path program 1 times [2024-11-09 09:59:01,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:59:01,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897211993] [2024-11-09 09:59:01,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:01,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:59:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:01,096 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-09 09:59:01,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:59:01,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897211993] [2024-11-09 09:59:01,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897211993] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:59:01,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:59:01,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 09:59:01,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121241366] [2024-11-09 09:59:01,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:59:01,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 09:59:01,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:59:01,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 09:59:01,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 09:59:01,098 INFO L87 Difference]: Start difference. First operand 1682 states and 2359 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 09:59:01,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:59:01,707 INFO L93 Difference]: Finished difference Result 1806 states and 2518 transitions. [2024-11-09 09:59:01,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 09:59:01,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 09:59:01,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:59:01,714 INFO L225 Difference]: With dead ends: 1806 [2024-11-09 09:59:01,714 INFO L226 Difference]: Without dead ends: 1806 [2024-11-09 09:59:01,714 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-09 09:59:01,715 INFO L432 NwaCegarLoop]: 761 mSDtfsCounter, 1286 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1289 SdHoareTripleChecker+Valid, 1400 SdHoareTripleChecker+Invalid, 776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 09:59:01,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1289 Valid, 1400 Invalid, 776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 09:59:01,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2024-11-09 09:59:01,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1659. [2024-11-09 09:59:01,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1659 states, 1350 states have (on average 1.6888888888888889) internal successors, (2280), 1652 states have internal predecessors, (2280), 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-09 09:59:01,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1659 states to 1659 states and 2290 transitions. [2024-11-09 09:59:01,753 INFO L78 Accepts]: Start accepts. Automaton has 1659 states and 2290 transitions. Word has length 14 [2024-11-09 09:59:01,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:59:01,754 INFO L471 AbstractCegarLoop]: Abstraction has 1659 states and 2290 transitions. [2024-11-09 09:59:01,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 09:59:01,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2290 transitions. [2024-11-09 09:59:01,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 09:59:01,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:59:01,755 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:59:01,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 09:59:01,755 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr331REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 09:59:01,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:59:01,756 INFO L85 PathProgramCache]: Analyzing trace with hash -186143239, now seen corresponding path program 1 times [2024-11-09 09:59:01,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:59:01,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036663546] [2024-11-09 09:59:01,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:01,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:59:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:01,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 09:59:01,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:59:01,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036663546] [2024-11-09 09:59:01,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036663546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:59:01,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:59:01,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 09:59:01,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695744714] [2024-11-09 09:59:01,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:59:01,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 09:59:01,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:59:01,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 09:59:01,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 09:59:01,902 INFO L87 Difference]: Start difference. First operand 1659 states and 2290 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 09:59:02,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:59:02,925 INFO L93 Difference]: Finished difference Result 2160 states and 2773 transitions. [2024-11-09 09:59:02,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 09:59:02,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-09 09:59:02,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:59:02,933 INFO L225 Difference]: With dead ends: 2160 [2024-11-09 09:59:02,933 INFO L226 Difference]: Without dead ends: 2160 [2024-11-09 09:59:02,933 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-09 09:59:02,934 INFO L432 NwaCegarLoop]: 850 mSDtfsCounter, 1277 mSDsluCounter, 1402 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1279 SdHoareTripleChecker+Valid, 2252 SdHoareTripleChecker+Invalid, 1046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-09 09:59:02,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1279 Valid, 2252 Invalid, 1046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-09 09:59:02,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2160 states. [2024-11-09 09:59:02,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2160 to 1755. [2024-11-09 09:59:02,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1755 states, 1446 states have (on average 1.669432918395574) internal successors, (2414), 1748 states have internal predecessors, (2414), 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-09 09:59:02,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 2424 transitions. [2024-11-09 09:59:02,967 INFO L78 Accepts]: Start accepts. Automaton has 1755 states and 2424 transitions. Word has length 14 [2024-11-09 09:59:02,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:59:02,967 INFO L471 AbstractCegarLoop]: Abstraction has 1755 states and 2424 transitions. [2024-11-09 09:59:02,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 09:59:02,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2424 transitions. [2024-11-09 09:59:02,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 09:59:02,969 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:59:02,969 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:59:02,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 09:59:02,970 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr355REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 09:59:02,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:59:02,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1505170837, now seen corresponding path program 1 times [2024-11-09 09:59:02,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:59:02,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728620339] [2024-11-09 09:59:02,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:02,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:59:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:03,027 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-09 09:59:03,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:59:03,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728620339] [2024-11-09 09:59:03,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728620339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:59:03,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:59:03,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 09:59:03,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162996906] [2024-11-09 09:59:03,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:59:03,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 09:59:03,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:59:03,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 09:59:03,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 09:59:03,029 INFO L87 Difference]: Start difference. First operand 1755 states and 2424 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-09 09:59:03,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:59:03,095 INFO L93 Difference]: Finished difference Result 1427 states and 1907 transitions. [2024-11-09 09:59:03,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 09:59:03,096 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2024-11-09 09:59:03,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:59:03,102 INFO L225 Difference]: With dead ends: 1427 [2024-11-09 09:59:03,103 INFO L226 Difference]: Without dead ends: 1427 [2024-11-09 09:59:03,103 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-09 09:59:03,104 INFO L432 NwaCegarLoop]: 944 mSDtfsCounter, 45 mSDsluCounter, 1865 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2809 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 09:59:03,105 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2809 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 09:59:03,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2024-11-09 09:59:03,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 1427. [2024-11-09 09:59:03,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1427 states, 1137 states have (on average 1.6684256816182939) internal successors, (1897), 1420 states have internal predecessors, (1897), 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-09 09:59:03,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1427 states to 1427 states and 1907 transitions. [2024-11-09 09:59:03,129 INFO L78 Accepts]: Start accepts. Automaton has 1427 states and 1907 transitions. Word has length 16 [2024-11-09 09:59:03,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:59:03,129 INFO L471 AbstractCegarLoop]: Abstraction has 1427 states and 1907 transitions. [2024-11-09 09:59:03,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-09 09:59:03,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1427 states and 1907 transitions. [2024-11-09 09:59:03,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 09:59:03,131 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:59:03,131 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-09 09:59:03,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 09:59:03,131 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 09:59:03,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:59:03,132 INFO L85 PathProgramCache]: Analyzing trace with hash -179577126, now seen corresponding path program 1 times [2024-11-09 09:59:03,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:59:03,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630199113] [2024-11-09 09:59:03,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:03,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:59:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:03,199 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-09 09:59:03,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:59:03,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630199113] [2024-11-09 09:59:03,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630199113] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:59:03,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:59:03,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 09:59:03,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366344504] [2024-11-09 09:59:03,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:59:03,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 09:59:03,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:59:03,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 09:59:03,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 09:59:03,202 INFO L87 Difference]: Start difference. First operand 1427 states and 1907 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) 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-09 09:59:03,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:59:03,847 INFO L93 Difference]: Finished difference Result 1541 states and 2015 transitions. [2024-11-09 09:59:03,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 09:59:03,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) 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-09 09:59:03,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:59:03,853 INFO L225 Difference]: With dead ends: 1541 [2024-11-09 09:59:03,853 INFO L226 Difference]: Without dead ends: 1541 [2024-11-09 09:59:03,854 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-09 09:59:03,856 INFO L432 NwaCegarLoop]: 828 mSDtfsCounter, 1182 mSDsluCounter, 825 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1185 SdHoareTripleChecker+Valid, 1653 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 09:59:03,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1185 Valid, 1653 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 09:59:03,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1541 states. [2024-11-09 09:59:03,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1541 to 1404. [2024-11-09 09:59:03,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1404 states, 1137 states have (on average 1.6279683377308707) internal successors, (1851), 1397 states have internal predecessors, (1851), 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-09 09:59:03,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1404 states to 1404 states and 1861 transitions. [2024-11-09 09:59:03,881 INFO L78 Accepts]: Start accepts. Automaton has 1404 states and 1861 transitions. Word has length 19 [2024-11-09 09:59:03,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:59:03,881 INFO L471 AbstractCegarLoop]: Abstraction has 1404 states and 1861 transitions. [2024-11-09 09:59:03,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) 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-09 09:59:03,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1404 states and 1861 transitions. [2024-11-09 09:59:03,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-09 09:59:03,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:59:03,883 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-09 09:59:03,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 09:59:03,883 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 09:59:03,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:59:03,883 INFO L85 PathProgramCache]: Analyzing trace with hash -179577125, now seen corresponding path program 1 times [2024-11-09 09:59:03,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:59:03,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415021094] [2024-11-09 09:59:03,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:03,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:59:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:03,951 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-09 09:59:03,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:59:03,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415021094] [2024-11-09 09:59:03,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415021094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:59:03,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:59:03,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 09:59:03,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249881252] [2024-11-09 09:59:03,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:59:03,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 09:59:03,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:59:03,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 09:59:03,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 09:59:03,954 INFO L87 Difference]: Start difference. First operand 1404 states and 1861 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-09 09:59:03,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:59:03,982 INFO L93 Difference]: Finished difference Result 1266 states and 1655 transitions. [2024-11-09 09:59:03,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 09:59:03,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-09 09:59:03,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:59:03,987 INFO L225 Difference]: With dead ends: 1266 [2024-11-09 09:59:03,988 INFO L226 Difference]: Without dead ends: 1266 [2024-11-09 09:59:03,989 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-09 09:59:03,989 INFO L432 NwaCegarLoop]: 828 mSDtfsCounter, 61 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1603 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 09:59:03,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1603 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 09:59:03,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2024-11-09 09:59:04,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1266. [2024-11-09 09:59:04,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1011 states have (on average 1.6271018793273986) internal successors, (1645), 1259 states have internal predecessors, (1645), 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-09 09:59:04,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1655 transitions. [2024-11-09 09:59:04,014 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1655 transitions. Word has length 19 [2024-11-09 09:59:04,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:59:04,014 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1655 transitions. [2024-11-09 09:59:04,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-09 09:59:04,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1655 transitions. [2024-11-09 09:59:04,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 09:59:04,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:59:04,017 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-09 09:59:04,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 09:59:04,017 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 09:59:04,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:59:04,019 INFO L85 PathProgramCache]: Analyzing trace with hash -774768265, now seen corresponding path program 1 times [2024-11-09 09:59:04,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:59:04,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761387250] [2024-11-09 09:59:04,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:04,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:59:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:04,079 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-09 09:59:04,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:59:04,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761387250] [2024-11-09 09:59:04,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761387250] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:59:04,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:59:04,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 09:59:04,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992218513] [2024-11-09 09:59:04,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:59:04,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 09:59:04,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:59:04,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 09:59:04,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 09:59:04,083 INFO L87 Difference]: Start difference. First operand 1266 states and 1655 transitions. Second operand has 4 states, 4 states have (on average 5.25) 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-09 09:59:04,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:59:04,144 INFO L93 Difference]: Finished difference Result 1237 states and 1605 transitions. [2024-11-09 09:59:04,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 09:59:04,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) 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-09 09:59:04,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:59:04,149 INFO L225 Difference]: With dead ends: 1237 [2024-11-09 09:59:04,149 INFO L226 Difference]: Without dead ends: 1237 [2024-11-09 09:59:04,149 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-09 09:59:04,150 INFO L432 NwaCegarLoop]: 793 mSDtfsCounter, 41 mSDsluCounter, 1558 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 2351 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 09:59:04,150 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 2351 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 09:59:04,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2024-11-09 09:59:04,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1231. [2024-11-09 09:59:04,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1231 states, 983 states have (on average 1.6164801627670398) internal successors, (1589), 1224 states have internal predecessors, (1589), 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-09 09:59:04,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 1599 transitions. [2024-11-09 09:59:04,172 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 1599 transitions. Word has length 21 [2024-11-09 09:59:04,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:59:04,173 INFO L471 AbstractCegarLoop]: Abstraction has 1231 states and 1599 transitions. [2024-11-09 09:59:04,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) 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-09 09:59:04,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 1599 transitions. [2024-11-09 09:59:04,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 09:59:04,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:59:04,175 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] [2024-11-09 09:59:04,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 09:59:04,175 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 09:59:04,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:59:04,177 INFO L85 PathProgramCache]: Analyzing trace with hash -441307835, now seen corresponding path program 1 times [2024-11-09 09:59:04,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:59:04,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260858230] [2024-11-09 09:59:04,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:04,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:59:04,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:04,318 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-09 09:59:04,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:59:04,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260858230] [2024-11-09 09:59:04,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260858230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:59:04,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:59:04,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 09:59:04,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913149043] [2024-11-09 09:59:04,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:59:04,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 09:59:04,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:59:04,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 09:59:04,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 09:59:04,320 INFO L87 Difference]: Start difference. First operand 1231 states and 1599 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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-09 09:59:04,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:59:04,984 INFO L93 Difference]: Finished difference Result 1813 states and 2395 transitions. [2024-11-09 09:59:04,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 09:59:04,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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 35 [2024-11-09 09:59:04,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:59:04,991 INFO L225 Difference]: With dead ends: 1813 [2024-11-09 09:59:04,991 INFO L226 Difference]: Without dead ends: 1813 [2024-11-09 09:59:04,991 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-09 09:59:04,992 INFO L432 NwaCegarLoop]: 897 mSDtfsCounter, 658 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 1905 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 09:59:04,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 1905 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 09:59:04,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2024-11-09 09:59:05,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1227. [2024-11-09 09:59:05,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1227 states, 983 states have (on average 1.6083418107833163) internal successors, (1581), 1220 states have internal predecessors, (1581), 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-09 09:59:05,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1227 states to 1227 states and 1591 transitions. [2024-11-09 09:59:05,014 INFO L78 Accepts]: Start accepts. Automaton has 1227 states and 1591 transitions. Word has length 35 [2024-11-09 09:59:05,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:59:05,014 INFO L471 AbstractCegarLoop]: Abstraction has 1227 states and 1591 transitions. [2024-11-09 09:59:05,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 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-09 09:59:05,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1227 states and 1591 transitions. [2024-11-09 09:59:05,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-09 09:59:05,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:59:05,017 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] [2024-11-09 09:59:05,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 09:59:05,017 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr376REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 09:59:05,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:59:05,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1141586281, now seen corresponding path program 1 times [2024-11-09 09:59:05,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:59:05,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378914887] [2024-11-09 09:59:05,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:05,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:59:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:05,092 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-09 09:59:05,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:59:05,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378914887] [2024-11-09 09:59:05,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378914887] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:59:05,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:59:05,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 09:59:05,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388374236] [2024-11-09 09:59:05,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:59:05,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 09:59:05,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:59:05,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 09:59:05,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 09:59:05,095 INFO L87 Difference]: Start difference. First operand 1227 states and 1591 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-09 09:59:05,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:59:05,147 INFO L93 Difference]: Finished difference Result 1209 states and 1561 transitions. [2024-11-09 09:59:05,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 09:59:05,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2024-11-09 09:59:05,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:59:05,151 INFO L225 Difference]: With dead ends: 1209 [2024-11-09 09:59:05,151 INFO L226 Difference]: Without dead ends: 1209 [2024-11-09 09:59:05,152 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-09 09:59:05,153 INFO L432 NwaCegarLoop]: 788 mSDtfsCounter, 27 mSDsluCounter, 1539 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 2327 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 09:59:05,153 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 2327 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 09:59:05,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2024-11-09 09:59:05,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1209. [2024-11-09 09:59:05,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 965 states have (on average 1.6072538860103627) internal successors, (1551), 1202 states have internal predecessors, (1551), 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-09 09:59:05,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1561 transitions. [2024-11-09 09:59:05,172 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1561 transitions. Word has length 62 [2024-11-09 09:59:05,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:59:05,174 INFO L471 AbstractCegarLoop]: Abstraction has 1209 states and 1561 transitions. [2024-11-09 09:59:05,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-09 09:59:05,174 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1561 transitions. [2024-11-09 09:59:05,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-09 09:59:05,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:59:05,178 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] [2024-11-09 09:59:05,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 09:59:05,178 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr117REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 09:59:05,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:59:05,178 INFO L85 PathProgramCache]: Analyzing trace with hash 116988697, now seen corresponding path program 1 times [2024-11-09 09:59:05,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:59:05,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003240623] [2024-11-09 09:59:05,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:05,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:59:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:05,287 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-09 09:59:05,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:59:05,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003240623] [2024-11-09 09:59:05,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003240623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:59:05,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:59:05,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 09:59:05,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491533201] [2024-11-09 09:59:05,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:59:05,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 09:59:05,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:59:05,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 09:59:05,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 09:59:05,291 INFO L87 Difference]: Start difference. First operand 1209 states and 1561 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-09 09:59:05,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:59:05,336 INFO L93 Difference]: Finished difference Result 1209 states and 1553 transitions. [2024-11-09 09:59:05,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 09:59:05,337 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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 69 [2024-11-09 09:59:05,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:59:05,341 INFO L225 Difference]: With dead ends: 1209 [2024-11-09 09:59:05,341 INFO L226 Difference]: Without dead ends: 1209 [2024-11-09 09:59:05,341 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-09 09:59:05,342 INFO L432 NwaCegarLoop]: 784 mSDtfsCounter, 21 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 2321 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 09:59:05,342 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 2321 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 09:59:05,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2024-11-09 09:59:05,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 1209. [2024-11-09 09:59:05,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 965 states have (on average 1.5989637305699482) internal successors, (1543), 1202 states have internal predecessors, (1543), 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-09 09:59:05,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1553 transitions. [2024-11-09 09:59:05,360 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1553 transitions. Word has length 69 [2024-11-09 09:59:05,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:59:05,360 INFO L471 AbstractCegarLoop]: Abstraction has 1209 states and 1553 transitions. [2024-11-09 09:59:05,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 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-09 09:59:05,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1553 transitions. [2024-11-09 09:59:05,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-09 09:59:05,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:59:05,361 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] [2024-11-09 09:59:05,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 09:59:05,362 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr376REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 09:59:05,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:59:05,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1547714973, now seen corresponding path program 1 times [2024-11-09 09:59:05,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:59:05,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602392247] [2024-11-09 09:59:05,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:05,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:59:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:05,452 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-09 09:59:05,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:59:05,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602392247] [2024-11-09 09:59:05,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602392247] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:59:05,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:59:05,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 09:59:05,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67877117] [2024-11-09 09:59:05,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:59:05,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 09:59:05,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:59:05,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 09:59:05,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 09:59:05,454 INFO L87 Difference]: Start difference. First operand 1209 states and 1553 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-09 09:59:05,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:59:05,514 INFO L93 Difference]: Finished difference Result 1474 states and 1856 transitions. [2024-11-09 09:59:05,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 09:59:05,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 70 [2024-11-09 09:59:05,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:59:05,520 INFO L225 Difference]: With dead ends: 1474 [2024-11-09 09:59:05,521 INFO L226 Difference]: Without dead ends: 1474 [2024-11-09 09:59:05,522 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-09 09:59:05,522 INFO L432 NwaCegarLoop]: 806 mSDtfsCounter, 201 mSDsluCounter, 753 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 1559 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 09:59:05,523 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 1559 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 09:59:05,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2024-11-09 09:59:05,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 1461. [2024-11-09 09:59:05,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1461 states, 1217 states have (on average 1.513557929334429) internal successors, (1842), 1454 states have internal predecessors, (1842), 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-09 09:59:05,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1461 states to 1461 states and 1852 transitions. [2024-11-09 09:59:05,543 INFO L78 Accepts]: Start accepts. Automaton has 1461 states and 1852 transitions. Word has length 70 [2024-11-09 09:59:05,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:59:05,543 INFO L471 AbstractCegarLoop]: Abstraction has 1461 states and 1852 transitions. [2024-11-09 09:59:05,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-09 09:59:05,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1461 states and 1852 transitions. [2024-11-09 09:59:05,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-09 09:59:05,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:59:05,544 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:59:05,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 09:59:05,545 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr414ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 09:59:05,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:59:05,545 INFO L85 PathProgramCache]: Analyzing trace with hash 616886410, now seen corresponding path program 1 times [2024-11-09 09:59:05,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:59:05,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305032813] [2024-11-09 09:59:05,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:05,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:59:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:05,926 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-09 09:59:05,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:59:05,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305032813] [2024-11-09 09:59:05,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305032813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:59:05,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:59:05,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 09:59:05,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713037878] [2024-11-09 09:59:05,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:59:05,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 09:59:05,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:59:05,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 09:59:05,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-09 09:59:05,927 INFO L87 Difference]: Start difference. First operand 1461 states and 1852 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 09:59:06,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:59:06,065 INFO L93 Difference]: Finished difference Result 2081 states and 2585 transitions. [2024-11-09 09:59:06,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 09:59:06,066 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2024-11-09 09:59:06,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:59:06,076 INFO L225 Difference]: With dead ends: 2081 [2024-11-09 09:59:06,076 INFO L226 Difference]: Without dead ends: 2078 [2024-11-09 09:59:06,077 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-09 09:59:06,077 INFO L432 NwaCegarLoop]: 1004 mSDtfsCounter, 727 mSDsluCounter, 2769 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 730 SdHoareTripleChecker+Valid, 3773 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 09:59:06,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [730 Valid, 3773 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 09:59:06,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2078 states. [2024-11-09 09:59:06,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2078 to 1362. [2024-11-09 09:59:06,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1362 states, 1118 states have (on average 1.5330948121645795) internal successors, (1714), 1355 states have internal predecessors, (1714), 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-09 09:59:06,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 1724 transitions. [2024-11-09 09:59:06,123 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 1724 transitions. Word has length 76 [2024-11-09 09:59:06,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:59:06,123 INFO L471 AbstractCegarLoop]: Abstraction has 1362 states and 1724 transitions. [2024-11-09 09:59:06,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 09:59:06,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 1724 transitions. [2024-11-09 09:59:06,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 09:59:06,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:59:06,125 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] [2024-11-09 09:59:06,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 09:59:06,125 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 09:59:06,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:59:06,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1225414216, now seen corresponding path program 1 times [2024-11-09 09:59:06,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:59:06,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254607514] [2024-11-09 09:59:06,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:06,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:59:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:06,408 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-09 09:59:06,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:59:06,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254607514] [2024-11-09 09:59:06,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254607514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:59:06,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:59:06,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 09:59:06,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191752185] [2024-11-09 09:59:06,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:59:06,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 09:59:06,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:59:06,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 09:59:06,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 09:59:06,411 INFO L87 Difference]: Start difference. First operand 1362 states and 1724 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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-09 09:59:06,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:59:06,969 INFO L93 Difference]: Finished difference Result 1361 states and 1722 transitions. [2024-11-09 09:59:06,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 09:59:06,972 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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 85 [2024-11-09 09:59:06,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:59:06,981 INFO L225 Difference]: With dead ends: 1361 [2024-11-09 09:59:06,981 INFO L226 Difference]: Without dead ends: 1361 [2024-11-09 09:59:06,981 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-09 09:59:06,982 INFO L432 NwaCegarLoop]: 795 mSDtfsCounter, 2 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 860 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2327 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 09:59:06,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2327 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 860 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 09:59:06,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2024-11-09 09:59:06,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1361. [2024-11-09 09:59:07,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1361 states, 1118 states have (on average 1.5313059033989267) internal successors, (1712), 1354 states have internal predecessors, (1712), 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-09 09:59:07,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 1722 transitions. [2024-11-09 09:59:07,003 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 1722 transitions. Word has length 85 [2024-11-09 09:59:07,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:59:07,003 INFO L471 AbstractCegarLoop]: Abstraction has 1361 states and 1722 transitions. [2024-11-09 09:59:07,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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-09 09:59:07,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1722 transitions. [2024-11-09 09:59:07,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-09 09:59:07,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:59:07,007 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:59:07,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 09:59:07,008 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 09:59:07,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:59:07,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1225414215, now seen corresponding path program 1 times [2024-11-09 09:59:07,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:59:07,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482503858] [2024-11-09 09:59:07,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:07,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:59:07,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:07,491 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-09 09:59:07,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:59:07,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482503858] [2024-11-09 09:59:07,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482503858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:59:07,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:59:07,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 09:59:07,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750955114] [2024-11-09 09:59:07,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:59:07,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 09:59:07,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:59:07,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 09:59:07,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 09:59:07,493 INFO L87 Difference]: Start difference. First operand 1361 states and 1722 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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-09 09:59:08,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:59:08,210 INFO L93 Difference]: Finished difference Result 1360 states and 1720 transitions. [2024-11-09 09:59:08,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 09:59:08,211 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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 85 [2024-11-09 09:59:08,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:59:08,213 INFO L225 Difference]: With dead ends: 1360 [2024-11-09 09:59:08,214 INFO L226 Difference]: Without dead ends: 1360 [2024-11-09 09:59:08,214 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-09 09:59:08,214 INFO L432 NwaCegarLoop]: 795 mSDtfsCounter, 1 mSDsluCounter, 1458 mSDsCounter, 0 mSdLazyCounter, 931 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2253 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 931 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 09:59:08,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2253 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 931 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 09:59:08,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2024-11-09 09:59:08,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 1360. [2024-11-09 09:59:08,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 1116 states have (on average 1.532258064516129) internal successors, (1710), 1353 states have internal predecessors, (1710), 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-09 09:59:08,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1720 transitions. [2024-11-09 09:59:08,231 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1720 transitions. Word has length 85 [2024-11-09 09:59:08,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:59:08,232 INFO L471 AbstractCegarLoop]: Abstraction has 1360 states and 1720 transitions. [2024-11-09 09:59:08,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 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-09 09:59:08,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1720 transitions. [2024-11-09 09:59:08,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 09:59:08,233 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:59:08,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] [2024-11-09 09:59:08,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 09:59:08,233 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 09:59:08,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:59:08,234 INFO L85 PathProgramCache]: Analyzing trace with hash 919408255, now seen corresponding path program 1 times [2024-11-09 09:59:08,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:59:08,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534999266] [2024-11-09 09:59:08,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:08,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:59:08,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:08,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 09:59:08,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:08,473 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-09 09:59:08,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:59:08,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534999266] [2024-11-09 09:59:08,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534999266] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:59:08,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:59:08,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 09:59:08,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669857345] [2024-11-09 09:59:08,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:59:08,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 09:59:08,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:59:08,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 09:59:08,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 09:59:08,476 INFO L87 Difference]: Start difference. First operand 1360 states and 1720 transitions. Second operand has 7 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 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-09 09:59:09,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:59:09,275 INFO L93 Difference]: Finished difference Result 1378 states and 1746 transitions. [2024-11-09 09:59:09,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 09:59:09,276 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 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 93 [2024-11-09 09:59:09,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:59:09,312 INFO L225 Difference]: With dead ends: 1378 [2024-11-09 09:59:09,313 INFO L226 Difference]: Without dead ends: 1378 [2024-11-09 09:59:09,313 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 09:59:09,313 INFO L432 NwaCegarLoop]: 787 mSDtfsCounter, 10 mSDsluCounter, 2811 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 3598 SdHoareTripleChecker+Invalid, 1186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 09:59:09,314 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 3598 Invalid, 1186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 09:59:09,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2024-11-09 09:59:09,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 1369. [2024-11-09 09:59:09,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1124 states have (on average 1.5311387900355873) internal successors, (1721), 1360 states have internal predecessors, (1721), 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-09 09:59:09,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1736 transitions. [2024-11-09 09:59:09,334 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1736 transitions. Word has length 93 [2024-11-09 09:59:09,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:59:09,334 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 1736 transitions. [2024-11-09 09:59:09,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 18.2) internal successors, (91), 6 states have internal predecessors, (91), 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-09 09:59:09,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1736 transitions. [2024-11-09 09:59:09,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-09 09:59:09,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:59:09,335 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:59:09,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 09:59:09,336 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 09:59:09,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:59:09,336 INFO L85 PathProgramCache]: Analyzing trace with hash 919408256, now seen corresponding path program 1 times [2024-11-09 09:59:09,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:59:09,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214689332] [2024-11-09 09:59:09,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:09,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:59:09,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:09,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 09:59:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:09,860 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-09 09:59:09,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:59:09,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214689332] [2024-11-09 09:59:09,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214689332] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:59:09,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:59:09,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 09:59:09,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059169644] [2024-11-09 09:59:09,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:59:09,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 09:59:09,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:59:09,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 09:59:09,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-09 09:59:09,862 INFO L87 Difference]: Start difference. First operand 1369 states and 1736 transitions. Second operand has 7 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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-09 09:59:10,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:59:10,645 INFO L93 Difference]: Finished difference Result 1369 states and 1734 transitions. [2024-11-09 09:59:10,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 09:59:10,646 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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 93 [2024-11-09 09:59:10,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:59:10,649 INFO L225 Difference]: With dead ends: 1369 [2024-11-09 09:59:10,649 INFO L226 Difference]: Without dead ends: 1369 [2024-11-09 09:59:10,649 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-09 09:59:10,650 INFO L432 NwaCegarLoop]: 791 mSDtfsCounter, 5 mSDsluCounter, 2133 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 2924 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 09:59:10,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 2924 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 09:59:10,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2024-11-09 09:59:10,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 1369. [2024-11-09 09:59:10,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 1124 states have (on average 1.5293594306049823) internal successors, (1719), 1360 states have internal predecessors, (1719), 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-09 09:59:10,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1734 transitions. [2024-11-09 09:59:10,672 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1734 transitions. Word has length 93 [2024-11-09 09:59:10,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:59:10,673 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 1734 transitions. [2024-11-09 09:59:10,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 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-09 09:59:10,673 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1734 transitions. [2024-11-09 09:59:10,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 09:59:10,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:59:10,674 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:59:10,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 09:59:10,674 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 09:59:10,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:59:10,675 INFO L85 PathProgramCache]: Analyzing trace with hash -941676498, now seen corresponding path program 1 times [2024-11-09 09:59:10,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:59:10,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015970926] [2024-11-09 09:59:10,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:10,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:59:10,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:11,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 09:59:11,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:11,257 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-09 09:59:11,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:59:11,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015970926] [2024-11-09 09:59:11,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015970926] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:59:11,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404350052] [2024-11-09 09:59:11,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:11,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:59:11,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:59:11,261 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-09 09:59:11,262 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-09 09:59:11,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:11,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 09:59:11,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:59:11,530 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-09 09:59:11,698 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 09:59:11,698 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-09 09:59:11,747 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-09 09:59:11,831 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-09 09:59:12,026 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 09:59:12,027 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-09 09:59:12,083 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-09 09:59:12,114 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-09 09:59:12,114 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:59:12,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404350052] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:59:12,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 09:59:12,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-09 09:59:12,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236110690] [2024-11-09 09:59:12,187 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 09:59:12,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 09:59:12,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:59:12,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 09:59:12,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=315, Unknown=11, NotChecked=0, Total=380 [2024-11-09 09:59:12,189 INFO L87 Difference]: Start difference. First operand 1369 states and 1734 transitions. Second operand has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 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-09 09:59:14,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:59:14,019 INFO L93 Difference]: Finished difference Result 1376 states and 1740 transitions. [2024-11-09 09:59:14,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 09:59:14,020 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 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 94 [2024-11-09 09:59:14,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:59:14,023 INFO L225 Difference]: With dead ends: 1376 [2024-11-09 09:59:14,023 INFO L226 Difference]: Without dead ends: 1376 [2024-11-09 09:59:14,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=501, Unknown=12, NotChecked=0, Total=600 [2024-11-09 09:59:14,023 INFO L432 NwaCegarLoop]: 500 mSDtfsCounter, 709 mSDsluCounter, 4852 mSDsCounter, 0 mSdLazyCounter, 3391 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 713 SdHoareTripleChecker+Valid, 5352 SdHoareTripleChecker+Invalid, 3407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 09:59:14,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [713 Valid, 5352 Invalid, 3407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3391 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 09:59:14,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2024-11-09 09:59:14,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1373. [2024-11-09 09:59:14,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1373 states, 1128 states have (on average 1.5265957446808511) internal successors, (1722), 1363 states have internal predecessors, (1722), 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-09 09:59:14,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1373 states to 1373 states and 1734 transitions. [2024-11-09 09:59:14,042 INFO L78 Accepts]: Start accepts. Automaton has 1373 states and 1734 transitions. Word has length 94 [2024-11-09 09:59:14,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:59:14,042 INFO L471 AbstractCegarLoop]: Abstraction has 1373 states and 1734 transitions. [2024-11-09 09:59:14,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 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-09 09:59:14,043 INFO L276 IsEmpty]: Start isEmpty. Operand 1373 states and 1734 transitions. [2024-11-09 09:59:14,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-09 09:59:14,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:59:14,045 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:59:14,064 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-09 09:59:14,245 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,SelfDestructingSolverStorable20 [2024-11-09 09:59:14,246 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 09:59:14,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:59:14,246 INFO L85 PathProgramCache]: Analyzing trace with hash -941676497, now seen corresponding path program 1 times [2024-11-09 09:59:14,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:59:14,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024842192] [2024-11-09 09:59:14,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:14,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:59:14,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:14,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 09:59:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:15,006 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-09 09:59:15,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:59:15,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024842192] [2024-11-09 09:59:15,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024842192] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:59:15,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892780887] [2024-11-09 09:59:15,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:15,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:59:15,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:59:15,010 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-09 09:59:15,012 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-09 09:59:15,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:15,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 09:59:15,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:59:15,261 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-09 09:59:15,379 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 09:59:15,380 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-09 09:59:15,389 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-09 09:59:15,419 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-09 09:59:15,421 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-09 09:59:15,503 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-09 09:59:15,508 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-09 09:59:15,606 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 09:59:15,607 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-09 09:59:15,614 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-09 09:59:15,648 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-09 09:59:15,652 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-09 09:59:15,671 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-09 09:59:15,671 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:59:15,773 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_773 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_773) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_773 (Array Int Int)) (v_ArrVal_774 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_773) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_774) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-09 09:59:15,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892780887] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:59:15,775 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 09:59:15,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 18 [2024-11-09 09:59:15,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607181913] [2024-11-09 09:59:15,777 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 09:59:15,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 09:59:15,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:59:15,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 09:59:15,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=360, Unknown=1, NotChecked=38, Total=462 [2024-11-09 09:59:15,778 INFO L87 Difference]: Start difference. First operand 1373 states and 1734 transitions. Second operand has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 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-09 09:59:17,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:59:17,860 INFO L93 Difference]: Finished difference Result 1375 states and 1738 transitions. [2024-11-09 09:59:17,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 09:59:17,863 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 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 94 [2024-11-09 09:59:17,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:59:17,866 INFO L225 Difference]: With dead ends: 1375 [2024-11-09 09:59:17,867 INFO L226 Difference]: Without dead ends: 1375 [2024-11-09 09:59:17,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=550, Unknown=1, NotChecked=48, Total=702 [2024-11-09 09:59:17,868 INFO L432 NwaCegarLoop]: 503 mSDtfsCounter, 707 mSDsluCounter, 4184 mSDsCounter, 0 mSdLazyCounter, 4006 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 4687 SdHoareTripleChecker+Invalid, 4024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 4006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-09 09:59:17,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 4687 Invalid, 4024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 4006 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-09 09:59:17,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2024-11-09 09:59:17,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1363. [2024-11-09 09:59:17,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1363 states, 1120 states have (on average 1.5276785714285714) internal successors, (1711), 1355 states have internal predecessors, (1711), 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-09 09:59:17,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1363 states to 1363 states and 1721 transitions. [2024-11-09 09:59:17,899 INFO L78 Accepts]: Start accepts. Automaton has 1363 states and 1721 transitions. Word has length 94 [2024-11-09 09:59:17,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:59:17,900 INFO L471 AbstractCegarLoop]: Abstraction has 1363 states and 1721 transitions. [2024-11-09 09:59:17,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 9.25) internal successors, (148), 18 states have internal predecessors, (148), 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-09 09:59:17,900 INFO L276 IsEmpty]: Start isEmpty. Operand 1363 states and 1721 transitions. [2024-11-09 09:59:17,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 09:59:17,901 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:59:17,901 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-09 09:59:17,920 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-09 09:59:18,105 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,SelfDestructingSolverStorable21 [2024-11-09 09:59:18,106 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 09:59:18,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:59:18,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1085513668, now seen corresponding path program 1 times [2024-11-09 09:59:18,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:59:18,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078025757] [2024-11-09 09:59:18,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:18,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:59:18,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:18,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 09:59:18,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:18,682 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-09 09:59:18,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:59:18,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078025757] [2024-11-09 09:59:18,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078025757] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:59:18,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:59:18,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 09:59:18,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017415704] [2024-11-09 09:59:18,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:59:18,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 09:59:18,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:59:18,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 09:59:18,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-09 09:59:18,685 INFO L87 Difference]: Start difference. First operand 1363 states and 1721 transitions. Second operand has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 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-09 09:59:19,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:59:19,904 INFO L93 Difference]: Finished difference Result 1382 states and 1746 transitions. [2024-11-09 09:59:19,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 09:59:19,905 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 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-09 09:59:19,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:59:19,908 INFO L225 Difference]: With dead ends: 1382 [2024-11-09 09:59:19,908 INFO L226 Difference]: Without dead ends: 1382 [2024-11-09 09:59:19,908 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-09 09:59:19,909 INFO L432 NwaCegarLoop]: 500 mSDtfsCounter, 725 mSDsluCounter, 3904 mSDsCounter, 0 mSdLazyCounter, 2785 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 4404 SdHoareTripleChecker+Invalid, 2798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 09:59:19,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 4404 Invalid, 2798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2785 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 09:59:19,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2024-11-09 09:59:19,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1378. [2024-11-09 09:59:19,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 1134 states have (on average 1.5238095238095237) internal successors, (1728), 1368 states have internal predecessors, (1728), 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-09 09:59:19,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1740 transitions. [2024-11-09 09:59:19,929 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1740 transitions. Word has length 96 [2024-11-09 09:59:19,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:59:19,930 INFO L471 AbstractCegarLoop]: Abstraction has 1378 states and 1740 transitions. [2024-11-09 09:59:19,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.833333333333333) internal successors, (94), 13 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-09 09:59:19,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1740 transitions. [2024-11-09 09:59:19,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-09 09:59:19,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:59:19,931 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-09 09:59:19,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 09:59:19,931 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 09:59:19,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:59:19,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1085513669, now seen corresponding path program 1 times [2024-11-09 09:59:19,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:59:19,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773562259] [2024-11-09 09:59:19,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:19,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:59:19,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:20,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 09:59:20,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:20,675 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-09 09:59:20,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:59:20,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773562259] [2024-11-09 09:59:20,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773562259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:59:20,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:59:20,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 09:59:20,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837101025] [2024-11-09 09:59:20,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:59:20,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 09:59:20,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:59:20,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 09:59:20,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-09 09:59:20,678 INFO L87 Difference]: Start difference. First operand 1378 states and 1740 transitions. Second operand has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 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-09 09:59:21,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:59:21,835 INFO L93 Difference]: Finished difference Result 1381 states and 1744 transitions. [2024-11-09 09:59:21,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 09:59:21,836 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 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-09 09:59:21,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:59:21,839 INFO L225 Difference]: With dead ends: 1381 [2024-11-09 09:59:21,839 INFO L226 Difference]: Without dead ends: 1381 [2024-11-09 09:59:21,839 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-09 09:59:21,840 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 736 mSDsluCounter, 2106 mSDsCounter, 0 mSdLazyCounter, 2187 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 740 SdHoareTripleChecker+Valid, 2610 SdHoareTripleChecker+Invalid, 2200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 09:59:21,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [740 Valid, 2610 Invalid, 2200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2187 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 09:59:21,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2024-11-09 09:59:21,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 1378. [2024-11-09 09:59:21,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1378 states, 1134 states have (on average 1.5220458553791887) internal successors, (1726), 1368 states have internal predecessors, (1726), 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-09 09:59:21,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1378 states to 1378 states and 1738 transitions. [2024-11-09 09:59:21,874 INFO L78 Accepts]: Start accepts. Automaton has 1378 states and 1738 transitions. Word has length 96 [2024-11-09 09:59:21,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:59:21,874 INFO L471 AbstractCegarLoop]: Abstraction has 1378 states and 1738 transitions. [2024-11-09 09:59:21,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.545454545454545) internal successors, (94), 11 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-09 09:59:21,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1378 states and 1738 transitions. [2024-11-09 09:59:21,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 09:59:21,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:59:21,875 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-09 09:59:21,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-09 09:59:21,879 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 09:59:21,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:59:21,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1242461109, now seen corresponding path program 1 times [2024-11-09 09:59:21,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:59:21,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995787786] [2024-11-09 09:59:21,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:21,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:59:21,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:22,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 09:59:22,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:22,404 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-09 09:59:22,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:59:22,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995787786] [2024-11-09 09:59:22,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995787786] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:59:22,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398627482] [2024-11-09 09:59:22,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:22,406 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:59:22,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:59:22,407 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-09 09:59:22,409 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-09 09:59:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:22,643 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 09:59:22,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:59:22,654 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-09 09:59:22,751 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 09:59:22,751 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-09 09:59:22,783 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-09 09:59:22,877 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-09 09:59:23,003 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 09:59:23,004 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-09 09:59:23,086 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 09:59:23,086 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-09 09:59:23,102 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-09 09:59:23,134 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-09 09:59:23,134 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:59:23,212 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1064 (Array Int Int)) (v_ArrVal_1061 (Array Int Int))) (= 1 (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1064))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1061)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-09 09:59:23,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398627482] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:59:23,214 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 09:59:23,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2024-11-09 09:59:23,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610011872] [2024-11-09 09:59:23,214 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 09:59:23,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 09:59:23,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:59:23,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 09:59:23,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=464, Unknown=12, NotChecked=44, Total=600 [2024-11-09 09:59:23,216 INFO L87 Difference]: Start difference. First operand 1378 states and 1738 transitions. Second operand has 22 states, 19 states have (on average 8.105263157894736) internal successors, (154), 21 states have internal predecessors, (154), 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-09 09:59:25,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:59:25,559 INFO L93 Difference]: Finished difference Result 1380 states and 1742 transitions. [2024-11-09 09:59:25,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 09:59:25,560 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 8.105263157894736) internal successors, (154), 21 states have internal predecessors, (154), 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-09 09:59:25,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:59:25,562 INFO L225 Difference]: With dead ends: 1380 [2024-11-09 09:59:25,562 INFO L226 Difference]: Without dead ends: 1380 [2024-11-09 09:59:25,563 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 93 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=640, Unknown=12, NotChecked=52, Total=812 [2024-11-09 09:59:25,563 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 702 mSDsluCounter, 6817 mSDsCounter, 0 mSdLazyCounter, 4608 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 7316 SdHoareTripleChecker+Invalid, 4621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 4608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 09:59:25,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 7316 Invalid, 4621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 4608 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 09:59:25,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2024-11-09 09:59:25,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1377. [2024-11-09 09:59:25,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1377 states, 1134 states have (on average 1.5202821869488536) internal successors, (1724), 1367 states have internal predecessors, (1724), 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-09 09:59:25,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1377 states to 1377 states and 1736 transitions. [2024-11-09 09:59:25,600 INFO L78 Accepts]: Start accepts. Automaton has 1377 states and 1736 transitions. Word has length 97 [2024-11-09 09:59:25,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:59:25,600 INFO L471 AbstractCegarLoop]: Abstraction has 1377 states and 1736 transitions. [2024-11-09 09:59:25,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 8.105263157894736) internal successors, (154), 21 states have internal predecessors, (154), 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-09 09:59:25,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1377 states and 1736 transitions. [2024-11-09 09:59:25,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-09 09:59:25,601 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:59:25,601 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-09 09:59:25,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 09:59:25,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:59:25,802 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 09:59:25,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:59:25,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1242461110, now seen corresponding path program 1 times [2024-11-09 09:59:25,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:59:25,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543993883] [2024-11-09 09:59:25,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:25,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:59:25,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:26,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 09:59:26,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:26,652 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-09 09:59:26,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:59:26,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543993883] [2024-11-09 09:59:26,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543993883] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:59:26,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286207945] [2024-11-09 09:59:26,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:26,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:59:26,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:59:26,655 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-09 09:59:26,656 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-09 09:59:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:26,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 09:59:26,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:59:26,903 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-09 09:59:27,005 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-09 09:59:27,013 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 09:59:27,014 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-09 09:59:27,024 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-09 09:59:27,034 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-09 09:59:27,080 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-09 09:59:27,085 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-09 09:59:27,167 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 09:59:27,168 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-09 09:59:27,176 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-09 09:59:27,236 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 09:59:27,236 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-09 09:59:27,243 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-09 09:59:27,257 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-09 09:59:27,260 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-09 09:59:27,264 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-09 09:59:27,265 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:59:27,320 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1221 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1221) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_1221 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1221) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))))) is different from false [2024-11-09 09:59:27,414 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1222 (Array Int Int)) (v_ArrVal_1221 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1227))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1228) .cse0 v_ArrVal_1221) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1222) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1228 (Array Int Int)) (v_ArrVal_1227 (Array Int Int)) (v_ArrVal_1221 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1228) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1227) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1221) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2024-11-09 09:59:27,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286207945] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:59:27,416 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 09:59:27,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 17 [2024-11-09 09:59:27,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350335378] [2024-11-09 09:59:27,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 09:59:27,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 09:59:27,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:59:27,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 09:59:27,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=340, Unknown=15, NotChecked=78, Total=506 [2024-11-09 09:59:27,418 INFO L87 Difference]: Start difference. First operand 1377 states and 1736 transitions. Second operand has 18 states, 15 states have (on average 9.8) internal successors, (147), 17 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:59:28,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:59:28,698 INFO L93 Difference]: Finished difference Result 1379 states and 1740 transitions. [2024-11-09 09:59:28,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 09:59:28,698 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 9.8) internal successors, (147), 17 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 97 [2024-11-09 09:59:28,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:59:28,700 INFO L225 Difference]: With dead ends: 1379 [2024-11-09 09:59:28,700 INFO L226 Difference]: Without dead ends: 1379 [2024-11-09 09:59:28,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=121, Invalid=574, Unknown=15, NotChecked=102, Total=812 [2024-11-09 09:59:28,701 INFO L432 NwaCegarLoop]: 502 mSDtfsCounter, 704 mSDsluCounter, 2605 mSDsCounter, 0 mSdLazyCounter, 2494 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 3107 SdHoareTripleChecker+Invalid, 2510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 09:59:28,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 3107 Invalid, 2510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2494 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 09:59:28,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2024-11-09 09:59:28,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 1361. [2024-11-09 09:59:28,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1361 states, 1120 states have (on average 1.5241071428571429) internal successors, (1707), 1353 states have internal predecessors, (1707), 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-09 09:59:28,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1361 states to 1361 states and 1717 transitions. [2024-11-09 09:59:28,721 INFO L78 Accepts]: Start accepts. Automaton has 1361 states and 1717 transitions. Word has length 97 [2024-11-09 09:59:28,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:59:28,722 INFO L471 AbstractCegarLoop]: Abstraction has 1361 states and 1717 transitions. [2024-11-09 09:59:28,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 9.8) internal successors, (147), 17 states have internal predecessors, (147), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 09:59:28,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1361 states and 1717 transitions. [2024-11-09 09:59:28,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 09:59:28,723 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:59:28,723 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-09 09:59:28,742 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-09 09:59:28,923 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,SelfDestructingSolverStorable25 [2024-11-09 09:59:28,924 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 09:59:28,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:59:28,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1729554310, now seen corresponding path program 1 times [2024-11-09 09:59:28,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:59:28,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844752302] [2024-11-09 09:59:28,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:28,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:59:28,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:29,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 09:59:29,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:29,558 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-09 09:59:29,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:59:29,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844752302] [2024-11-09 09:59:29,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844752302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:59:29,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:59:29,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 09:59:29,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406754039] [2024-11-09 09:59:29,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:59:29,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 09:59:29,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:59:29,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 09:59:29,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-09 09:59:29,561 INFO L87 Difference]: Start difference. First operand 1361 states and 1717 transitions. Second operand has 15 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 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-09 09:59:31,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:59:31,143 INFO L93 Difference]: Finished difference Result 1386 states and 1748 transitions. [2024-11-09 09:59:31,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 09:59:31,143 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 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-09 09:59:31,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:59:31,146 INFO L225 Difference]: With dead ends: 1386 [2024-11-09 09:59:31,146 INFO L226 Difference]: Without dead ends: 1386 [2024-11-09 09:59:31,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-11-09 09:59:31,147 INFO L432 NwaCegarLoop]: 499 mSDtfsCounter, 724 mSDsluCounter, 5331 mSDsCounter, 0 mSdLazyCounter, 3693 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 5830 SdHoareTripleChecker+Invalid, 3706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 09:59:31,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 5830 Invalid, 3706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3693 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 09:59:31,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2024-11-09 09:59:31,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1382. [2024-11-09 09:59:31,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1382 states, 1140 states have (on average 1.5175438596491229) internal successors, (1730), 1372 states have internal predecessors, (1730), 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-09 09:59:31,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 1742 transitions. [2024-11-09 09:59:31,159 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 1742 transitions. Word has length 99 [2024-11-09 09:59:31,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:59:31,159 INFO L471 AbstractCegarLoop]: Abstraction has 1382 states and 1742 transitions. [2024-11-09 09:59:31,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.461538461538462) internal successors, (97), 14 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-09 09:59:31,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1742 transitions. [2024-11-09 09:59:31,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-09 09:59:31,160 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:59:31,160 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-09 09:59:31,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-09 09:59:31,161 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 09:59:31,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:59:31,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1729554311, now seen corresponding path program 1 times [2024-11-09 09:59:31,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:59:31,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919540285] [2024-11-09 09:59:31,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:31,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:59:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:31,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 09:59:31,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:32,018 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-09 09:59:32,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:59:32,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919540285] [2024-11-09 09:59:32,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919540285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:59:32,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:59:32,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-09 09:59:32,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523567799] [2024-11-09 09:59:32,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:59:32,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 09:59:32,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:59:32,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 09:59:32,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-09 09:59:32,020 INFO L87 Difference]: Start difference. First operand 1382 states and 1742 transitions. Second operand has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 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-09 09:59:33,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:59:33,230 INFO L93 Difference]: Finished difference Result 1385 states and 1746 transitions. [2024-11-09 09:59:33,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 09:59:33,231 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 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-09 09:59:33,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:59:33,234 INFO L225 Difference]: With dead ends: 1385 [2024-11-09 09:59:33,234 INFO L226 Difference]: Without dead ends: 1385 [2024-11-09 09:59:33,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-09 09:59:33,236 INFO L432 NwaCegarLoop]: 503 mSDtfsCounter, 737 mSDsluCounter, 2482 mSDsCounter, 0 mSdLazyCounter, 2599 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 741 SdHoareTripleChecker+Valid, 2985 SdHoareTripleChecker+Invalid, 2612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2599 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 09:59:33,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [741 Valid, 2985 Invalid, 2612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2599 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 09:59:33,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2024-11-09 09:59:33,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 1382. [2024-11-09 09:59:33,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1382 states, 1140 states have (on average 1.5157894736842106) internal successors, (1728), 1372 states have internal predecessors, (1728), 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-09 09:59:33,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1382 states to 1382 states and 1740 transitions. [2024-11-09 09:59:33,255 INFO L78 Accepts]: Start accepts. Automaton has 1382 states and 1740 transitions. Word has length 99 [2024-11-09 09:59:33,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:59:33,255 INFO L471 AbstractCegarLoop]: Abstraction has 1382 states and 1740 transitions. [2024-11-09 09:59:33,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.083333333333334) internal successors, (97), 12 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-09 09:59:33,255 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states and 1740 transitions. [2024-11-09 09:59:33,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 09:59:33,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:59:33,256 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-09 09:59:33,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-09 09:59:33,257 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 09:59:33,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:59:33,257 INFO L85 PathProgramCache]: Analyzing trace with hash 131383797, now seen corresponding path program 1 times [2024-11-09 09:59:33,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:59:33,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169117978] [2024-11-09 09:59:33,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:33,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:59:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:33,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 09:59:33,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:33,860 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-09 09:59:33,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:59:33,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169117978] [2024-11-09 09:59:33,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169117978] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:59:33,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867866070] [2024-11-09 09:59:33,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:33,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:59:33,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:59:33,863 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-09 09:59:33,864 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-09 09:59:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:34,135 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-09 09:59:34,139 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:59:34,146 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-09 09:59:34,249 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 09:59:34,250 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-09 09:59:34,274 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-09 09:59:34,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2024-11-09 09:59:34,477 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 09:59:34,478 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-09 09:59:34,558 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 09:59:34,558 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-09 09:59:34,615 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 09:59:34,616 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-09 09:59:34,631 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-09 09:59:34,660 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-09 09:59:34,660 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:59:34,723 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1540 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_1539))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1540)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 09:59:34,727 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1540 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1539))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1540)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 09:59:34,754 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1543 (Array Int Int)) (v_ArrVal_1540 (Array Int Int)) (v_ArrVal_1539 (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$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1543))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1539)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1540)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-09 09:59:34,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867866070] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:59:34,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 09:59:34,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 23 [2024-11-09 09:59:34,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402019162] [2024-11-09 09:59:34,756 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 09:59:34,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 09:59:34,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:59:34,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 09:59:34,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=546, Unknown=17, NotChecked=150, Total=812 [2024-11-09 09:59:34,757 INFO L87 Difference]: Start difference. First operand 1382 states and 1740 transitions. Second operand has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 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-09 09:59:36,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:59:36,542 INFO L93 Difference]: Finished difference Result 1384 states and 1744 transitions. [2024-11-09 09:59:36,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 09:59:36,542 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 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-09 09:59:36,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:59:36,545 INFO L225 Difference]: With dead ends: 1384 [2024-11-09 09:59:36,545 INFO L226 Difference]: Without dead ends: 1384 [2024-11-09 09:59:36,545 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=738, Unknown=17, NotChecked=174, Total=1056 [2024-11-09 09:59:36,546 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 699 mSDsluCounter, 5352 mSDsCounter, 0 mSdLazyCounter, 3699 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 5850 SdHoareTripleChecker+Invalid, 3714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 09:59:36,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 5850 Invalid, 3714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3699 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 09:59:36,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2024-11-09 09:59:36,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1381. [2024-11-09 09:59:36,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1381 states, 1140 states have (on average 1.5140350877192983) internal successors, (1726), 1371 states have internal predecessors, (1726), 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-09 09:59:36,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1381 states to 1381 states and 1738 transitions. [2024-11-09 09:59:36,560 INFO L78 Accepts]: Start accepts. Automaton has 1381 states and 1738 transitions. Word has length 100 [2024-11-09 09:59:36,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:59:36,561 INFO L471 AbstractCegarLoop]: Abstraction has 1381 states and 1738 transitions. [2024-11-09 09:59:36,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 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-09 09:59:36,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1381 states and 1738 transitions. [2024-11-09 09:59:36,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-09 09:59:36,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:59:36,562 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 09:59:36,581 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-09 09:59:36,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-09 09:59:36,763 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 09:59:36,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:59:36,764 INFO L85 PathProgramCache]: Analyzing trace with hash 131383798, now seen corresponding path program 1 times [2024-11-09 09:59:36,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:59:36,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123073583] [2024-11-09 09:59:36,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:36,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:59:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:37,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 09:59:37,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:37,628 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-09 09:59:37,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:59:37,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123073583] [2024-11-09 09:59:37,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123073583] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:59:37,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993322697] [2024-11-09 09:59:37,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:37,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:59:37,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:59:37,631 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-09 09:59:37,632 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-09 09:59:37,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:37,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 09:59:37,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:59:37,901 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-09 09:59:37,990 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-09 09:59:37,997 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 09:59:37,997 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-09 09:59:38,028 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-09 09:59:38,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 09:59:38,107 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-09 09:59:38,110 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-09 09:59:38,203 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 09:59:38,204 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-09 09:59:38,211 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-09 09:59:38,283 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 09:59:38,284 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-09 09:59:38,290 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-09 09:59:38,359 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 09:59:38,360 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-09 09:59:38,370 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-09 09:59:38,418 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 30 treesize of output 12 [2024-11-09 09:59:38,420 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-09 09:59:38,447 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-09 09:59:38,447 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:59:38,919 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1712 (Array Int Int)) (v_ArrVal_1721 (Array Int Int)) (v_ArrVal_1720 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1721))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse0 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1720) .cse5 v_ArrVal_1712))) (or (< (+ (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int)) (v_ArrVal_1715 (Array Int Int))) (let ((.cse3 (store .cse4 .cse5 v_ArrVal_1713))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store .cse0 .cse2 v_ArrVal_1714) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_1715) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))))))) (forall ((v_ArrVal_1712 (Array Int Int)) (v_ArrVal_1721 (Array Int Int)) (v_ArrVal_1720 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1721))) (let ((.cse8 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (let ((.cse6 (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1720) .cse8 v_ArrVal_1712))) (or (< (+ (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4) 0) (forall ((v_ArrVal_1714 (Array Int Int)) (v_ArrVal_1713 (Array Int Int))) (<= 0 (+ (select (select (store .cse6 (select (select (store .cse7 .cse8 v_ArrVal_1713) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1714) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8)))))))))) is different from false [2024-11-09 09:59:38,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993322697] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:59:38,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 09:59:38,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 23 [2024-11-09 09:59:38,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591174573] [2024-11-09 09:59:38,922 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 09:59:38,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-09 09:59:38,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:59:38,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-09 09:59:38,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=745, Unknown=15, NotChecked=56, Total=930 [2024-11-09 09:59:38,924 INFO L87 Difference]: Start difference. First operand 1381 states and 1738 transitions. Second operand has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 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-09 09:59:41,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:59:41,654 INFO L93 Difference]: Finished difference Result 1383 states and 1742 transitions. [2024-11-09 09:59:41,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 09:59:41,655 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 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-09 09:59:41,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:59:41,657 INFO L225 Difference]: With dead ends: 1383 [2024-11-09 09:59:41,657 INFO L226 Difference]: Without dead ends: 1383 [2024-11-09 09:59:41,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=191, Invalid=1130, Unknown=15, NotChecked=70, Total=1406 [2024-11-09 09:59:41,658 INFO L432 NwaCegarLoop]: 501 mSDtfsCounter, 706 mSDsluCounter, 6103 mSDsCounter, 0 mSdLazyCounter, 6079 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 6604 SdHoareTripleChecker+Invalid, 6096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 6079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-09 09:59:41,658 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 6604 Invalid, 6096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 6079 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-09 09:59:41,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2024-11-09 09:59:41,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 1359. [2024-11-09 09:59:41,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1359 states, 1120 states have (on average 1.5205357142857143) internal successors, (1703), 1351 states have internal predecessors, (1703), 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-09 09:59:41,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 1713 transitions. [2024-11-09 09:59:41,671 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 1713 transitions. Word has length 100 [2024-11-09 09:59:41,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:59:41,671 INFO L471 AbstractCegarLoop]: Abstraction has 1359 states and 1713 transitions. [2024-11-09 09:59:41,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 7.619047619047619) internal successors, (160), 23 states have internal predecessors, (160), 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-09 09:59:41,672 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 1713 transitions. [2024-11-09 09:59:41,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 09:59:41,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:59:41,673 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:59:41,691 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-09 09:59:41,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:59:41,877 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 09:59:41,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:59:41,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1569551445, now seen corresponding path program 1 times [2024-11-09 09:59:41,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:59:41,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271853178] [2024-11-09 09:59:41,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:41,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:59:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:42,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 09:59:42,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:42,380 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-09 09:59:42,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:59:42,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271853178] [2024-11-09 09:59:42,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271853178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:59:42,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:59:42,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 09:59:42,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797700323] [2024-11-09 09:59:42,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:59:42,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 09:59:42,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:59:42,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 09:59:42,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-09 09:59:42,383 INFO L87 Difference]: Start difference. First operand 1359 states and 1713 transitions. Second operand has 14 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 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-09 09:59:43,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:59:43,717 INFO L93 Difference]: Finished difference Result 1390 states and 1750 transitions. [2024-11-09 09:59:43,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 09:59:43,718 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 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-09 09:59:43,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:59:43,721 INFO L225 Difference]: With dead ends: 1390 [2024-11-09 09:59:43,721 INFO L226 Difference]: Without dead ends: 1390 [2024-11-09 09:59:43,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=345, Unknown=0, NotChecked=0, Total=420 [2024-11-09 09:59:43,722 INFO L432 NwaCegarLoop]: 501 mSDtfsCounter, 744 mSDsluCounter, 4366 mSDsCounter, 0 mSdLazyCounter, 3019 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 4867 SdHoareTripleChecker+Invalid, 3034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 3019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 09:59:43,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 4867 Invalid, 3034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 3019 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 09:59:43,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2024-11-09 09:59:43,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1386. [2024-11-09 09:59:43,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 1146 states have (on average 1.5113438045375218) internal successors, (1732), 1376 states have internal predecessors, (1732), 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-09 09:59:43,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 1744 transitions. [2024-11-09 09:59:43,737 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 1744 transitions. Word has length 102 [2024-11-09 09:59:43,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:59:43,738 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 1744 transitions. [2024-11-09 09:59:43,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 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-09 09:59:43,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1744 transitions. [2024-11-09 09:59:43,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-09 09:59:43,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:59:43,739 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-09 09:59:43,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-09 09:59:43,739 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 09:59:43,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:59:43,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1569551444, now seen corresponding path program 1 times [2024-11-09 09:59:43,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:59:43,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558585826] [2024-11-09 09:59:43,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:43,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:59:43,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:44,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 09:59:44,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:44,615 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-09 09:59:44,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:59:44,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558585826] [2024-11-09 09:59:44,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558585826] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:59:44,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:59:44,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 09:59:44,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915552269] [2024-11-09 09:59:44,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:59:44,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 09:59:44,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:59:44,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 09:59:44,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-09 09:59:44,618 INFO L87 Difference]: Start difference. First operand 1386 states and 1744 transitions. Second operand has 14 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 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-09 09:59:46,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:59:46,173 INFO L93 Difference]: Finished difference Result 1389 states and 1748 transitions. [2024-11-09 09:59:46,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 09:59:46,173 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 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-09 09:59:46,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:59:46,175 INFO L225 Difference]: With dead ends: 1389 [2024-11-09 09:59:46,176 INFO L226 Difference]: Without dead ends: 1389 [2024-11-09 09:59:46,176 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-09 09:59:46,176 INFO L432 NwaCegarLoop]: 502 mSDtfsCounter, 720 mSDsluCounter, 3318 mSDsCounter, 0 mSdLazyCounter, 3311 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 724 SdHoareTripleChecker+Valid, 3820 SdHoareTripleChecker+Invalid, 3324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 09:59:46,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [724 Valid, 3820 Invalid, 3324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3311 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 09:59:46,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2024-11-09 09:59:46,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 1386. [2024-11-09 09:59:46,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1386 states, 1146 states have (on average 1.5095986038394416) internal successors, (1730), 1376 states have internal predecessors, (1730), 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-09 09:59:46,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 1742 transitions. [2024-11-09 09:59:46,191 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 1742 transitions. Word has length 102 [2024-11-09 09:59:46,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:59:46,192 INFO L471 AbstractCegarLoop]: Abstraction has 1386 states and 1742 transitions. [2024-11-09 09:59:46,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 13 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-09 09:59:46,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1742 transitions. [2024-11-09 09:59:46,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 09:59:46,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:59:46,193 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 09:59:46,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-09 09:59:46,193 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 09:59:46,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:59:46,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1340139228, now seen corresponding path program 1 times [2024-11-09 09:59:46,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:59:46,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011764626] [2024-11-09 09:59:46,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:46,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:59:46,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:46,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 09:59:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:46,840 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-09 09:59:46,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:59:46,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011764626] [2024-11-09 09:59:46,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011764626] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:59:46,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802358144] [2024-11-09 09:59:46,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:46,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:59:46,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:59:46,843 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-09 09:59:46,844 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-09 09:59:47,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:47,116 INFO L255 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 09:59:47,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:59:47,124 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-09 09:59:47,361 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 09:59:47,362 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-09 09:59:47,405 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-09 09:59:47,412 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-09 09:59:47,558 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 09:59:47,558 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 51 treesize of output 48 [2024-11-09 09:59:47,564 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-09 09:59:47,581 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 19 treesize of output 7 [2024-11-09 09:59:47,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 09:59:47,620 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 32 [2024-11-09 09:59:47,692 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 09:59:47,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 32 [2024-11-09 09:59:47,740 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 09:59:47,740 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-09 09:59:47,788 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-09 09:59:47,791 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-09 09:59:47,791 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:59:47,808 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-09 09:59:47,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 09:59:47,848 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2061 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (= .cse0 (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2061) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))) is different from false [2024-11-09 09:59:47,855 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2061 (Array Int Int)) (v_ArrVal_2060 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2060)) (.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_2061) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-09 09:59:47,860 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2061 (Array Int Int)) (v_ArrVal_2060 (Array Int Int))) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (store |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2060))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= (select (select (store .cse0 .cse1 v_ArrVal_2061) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) .cse1))))) is different from false [2024-11-09 09:59:47,872 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2061 (Array Int Int)) (v_ArrVal_2060 (Array Int Int)) (v_ArrVal_2058 Int)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse1 (let ((.cse3 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base|) (+ |c_ULTIMATE.start_main_#t~mem56#1.offset| 16) v_ArrVal_2058)))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2060)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_2061) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-09 09:59:47,883 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2061 (Array Int Int)) (v_ArrVal_2060 (Array Int Int)) (v_ArrVal_2058 Int) (|v_ULTIMATE.start_main_#t~mem56#1.offset_19| Int)) (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (or (let ((.cse1 (let ((.cse3 (let ((.cse4 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store |c_#memory_$Pointer$#2.base| .cse4 (store (select |c_#memory_$Pointer$#2.base| .cse4) (+ 16 |v_ULTIMATE.start_main_#t~mem56#1.offset_19|) v_ArrVal_2058))))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2060)))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_2061) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))) (< |v_ULTIMATE.start_main_#t~mem56#1.offset_19| (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))))) is different from false [2024-11-09 09:59:47,935 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2061 (Array Int Int)) (v_ArrVal_2060 (Array Int Int)) (v_ArrVal_2058 Int) (v_ArrVal_2067 (Array Int Int)) (|v_ULTIMATE.start_main_#t~mem56#1.offset_19| Int) (v_ArrVal_2066 (Array Int Int))) (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (or (< |v_ULTIMATE.start_main_#t~mem56#1.offset_19| (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2066) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)) (let ((.cse2 (let ((.cse3 (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2067))) (let ((.cse5 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (store .cse4 .cse5 (store (select .cse4 .cse5) (+ 16 |v_ULTIMATE.start_main_#t~mem56#1.offset_19|) v_ArrVal_2058)))))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_2060)))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (= .cse1 (select (select (store .cse2 .cse1 v_ArrVal_2061) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))))))) is different from false [2024-11-09 09:59:47,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802358144] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:59:47,937 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 09:59:47,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 27 [2024-11-09 09:59:47,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56205372] [2024-11-09 09:59:47,937 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 09:59:47,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-09 09:59:47,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:59:47,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-09 09:59:47,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=719, Unknown=14, NotChecked=354, Total=1190 [2024-11-09 09:59:47,939 INFO L87 Difference]: Start difference. First operand 1386 states and 1742 transitions. Second operand has 28 states, 25 states have (on average 7.84) internal successors, (196), 27 states have internal predecessors, (196), 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-09 09:59:50,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:59:50,365 INFO L93 Difference]: Finished difference Result 1683 states and 2114 transitions. [2024-11-09 09:59:50,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 09:59:50,366 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 7.84) internal successors, (196), 27 states have internal predecessors, (196), 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-09 09:59:50,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:59:50,368 INFO L225 Difference]: With dead ends: 1683 [2024-11-09 09:59:50,368 INFO L226 Difference]: Without dead ends: 1683 [2024-11-09 09:59:50,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=226, Invalid=1424, Unknown=14, NotChecked=498, Total=2162 [2024-11-09 09:59:50,370 INFO L432 NwaCegarLoop]: 510 mSDtfsCounter, 952 mSDsluCounter, 8703 mSDsCounter, 0 mSdLazyCounter, 5575 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 956 SdHoareTripleChecker+Valid, 9213 SdHoareTripleChecker+Invalid, 5597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 5575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-09 09:59:50,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [956 Valid, 9213 Invalid, 5597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 5575 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-09 09:59:50,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2024-11-09 09:59:50,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1385. [2024-11-09 09:59:50,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1385 states, 1146 states have (on average 1.5078534031413613) internal successors, (1728), 1375 states have internal predecessors, (1728), 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-09 09:59:50,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1385 states to 1385 states and 1740 transitions. [2024-11-09 09:59:50,386 INFO L78 Accepts]: Start accepts. Automaton has 1385 states and 1740 transitions. Word has length 103 [2024-11-09 09:59:50,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:59:50,387 INFO L471 AbstractCegarLoop]: Abstraction has 1385 states and 1740 transitions. [2024-11-09 09:59:50,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 7.84) internal successors, (196), 27 states have internal predecessors, (196), 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-09 09:59:50,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1385 states and 1740 transitions. [2024-11-09 09:59:50,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-09 09:59:50,388 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:59:50,388 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-09 09:59:50,408 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-09 09:59:50,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:59:50,593 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 09:59:50,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:59:50,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1340139229, now seen corresponding path program 1 times [2024-11-09 09:59:50,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:59:50,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392438230] [2024-11-09 09:59:50,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:50,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:59:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:51,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 09:59:51,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:51,515 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-09 09:59:51,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:59:51,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392438230] [2024-11-09 09:59:51,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392438230] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:59:51,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600097620] [2024-11-09 09:59:51,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:51,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 09:59:51,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 09:59:51,518 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-09 09:59:51,519 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-09 09:59:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:51,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-11-09 09:59:51,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 09:59:51,771 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-09 09:59:51,849 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 09:59:51,849 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-09 09:59:51,855 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-09 09:59:51,879 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-09 09:59:51,882 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-09 09:59:51,947 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-09 09:59:51,950 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-09 09:59:52,038 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 09:59:52,038 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-09 09:59:52,046 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-09 09:59:52,117 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 09:59:52,117 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-09 09:59:52,125 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-09 09:59:52,178 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 09:59:52,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-09 09:59:52,185 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-09 09:59:52,245 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-09 09:59:52,245 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-09 09:59:52,250 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-09 09:59:52,264 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-09 09:59:52,267 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-09 09:59:52,290 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-09 09:59:52,291 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 09:59:52,413 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_2252 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2252) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))) (forall ((v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2252) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2253) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-09 09:59:52,426 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int)) (v_ArrVal_2250 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2251))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2250) .cse0 v_ArrVal_2252) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_2253) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int)) (v_ArrVal_2250 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2250) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem57#1.base| v_ArrVal_2251) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_2252) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2024-11-09 09:59:52,528 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2249 (Array Int Int)) (v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int)) (v_ArrVal_2250 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2249))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_2251))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2248) .cse0 v_ArrVal_2250) .cse1 v_ArrVal_2252) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_2253) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_2249 (Array Int Int)) (v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int)) (v_ArrVal_2250 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse6 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2249))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem56#1.base| v_ArrVal_2248) .cse5 v_ArrVal_2250) (select (select (store .cse6 .cse5 v_ArrVal_2251) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2252))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))))) is different from false [2024-11-09 09:59:52,562 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$#2.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_2249 (Array Int Int)) (v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int)) (v_ArrVal_2250 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2249))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2248) .cse1 v_ArrVal_2250) (select (select (store .cse2 .cse1 v_ArrVal_2251) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2252))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_2249 (Array Int Int)) (v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int)) (v_ArrVal_2250 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#2.base| .cse0 v_ArrVal_2249))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_2251))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#2.offset| .cse0 v_ArrVal_2248) .cse4 v_ArrVal_2250) .cse5 v_ArrVal_2252) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_2253) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) is different from false [2024-11-09 09:59:52,622 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_2249 (Array Int Int)) (v_ArrVal_2259 (Array Int Int)) (v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2258 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int)) (v_ArrVal_2250 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2259))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_2249))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2258) .cse0 v_ArrVal_2248) .cse1 v_ArrVal_2250) (select (select (store .cse2 .cse1 v_ArrVal_2251) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_2252))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((v_ArrVal_2249 (Array Int Int)) (v_ArrVal_2259 (Array Int Int)) (v_ArrVal_2248 (Array Int Int)) (v_ArrVal_2258 (Array Int Int)) (v_ArrVal_2253 (Array Int Int)) (v_ArrVal_2252 (Array Int Int)) (v_ArrVal_2251 (Array Int Int)) (v_ArrVal_2250 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2259))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_2249))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_2251))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_2258) .cse5 v_ArrVal_2248) .cse6 v_ArrVal_2250) .cse7 v_ArrVal_2252) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_2253) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2024-11-09 09:59:52,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600097620] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 09:59:52,625 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 09:59:52,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2024-11-09 09:59:52,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279425327] [2024-11-09 09:59:52,626 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 09:59:52,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-09 09:59:52,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:59:52,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-09 09:59:52,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=695, Unknown=21, NotChecked=290, Total=1122 [2024-11-09 09:59:52,627 INFO L87 Difference]: Start difference. First operand 1385 states and 1740 transitions. Second operand has 25 states, 22 states have (on average 7.545454545454546) internal successors, (166), 24 states have internal predecessors, (166), 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-09 09:59:55,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:59:55,559 INFO L93 Difference]: Finished difference Result 1387 states and 1744 transitions. [2024-11-09 09:59:55,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 09:59:55,559 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 7.545454545454546) internal successors, (166), 24 states have internal predecessors, (166), 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-09 09:59:55,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:59:55,561 INFO L225 Difference]: With dead ends: 1387 [2024-11-09 09:59:55,561 INFO L226 Difference]: Without dead ends: 1387 [2024-11-09 09:59:55,562 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=193, Invalid=1138, Unknown=21, NotChecked=370, Total=1722 [2024-11-09 09:59:55,562 INFO L432 NwaCegarLoop]: 500 mSDtfsCounter, 701 mSDsluCounter, 6107 mSDsCounter, 0 mSdLazyCounter, 6076 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 6607 SdHoareTripleChecker+Invalid, 6092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 6076 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-09 09:59:55,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 6607 Invalid, 6092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 6076 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-09 09:59:55,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2024-11-09 09:59:55,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 1357. [2024-11-09 09:59:55,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1357 states, 1120 states have (on average 1.5169642857142858) internal successors, (1699), 1349 states have internal predecessors, (1699), 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-09 09:59:55,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1357 states to 1357 states and 1709 transitions. [2024-11-09 09:59:55,588 INFO L78 Accepts]: Start accepts. Automaton has 1357 states and 1709 transitions. Word has length 103 [2024-11-09 09:59:55,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:59:55,588 INFO L471 AbstractCegarLoop]: Abstraction has 1357 states and 1709 transitions. [2024-11-09 09:59:55,588 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 7.545454545454546) internal successors, (166), 24 states have internal predecessors, (166), 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-09 09:59:55,588 INFO L276 IsEmpty]: Start isEmpty. Operand 1357 states and 1709 transitions. [2024-11-09 09:59:55,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 09:59:55,589 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:59:55,589 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-09 09:59:55,609 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-09 09:59:55,793 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,SelfDestructingSolverStorable33 [2024-11-09 09:59:55,794 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 09:59:55,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:59:55,794 INFO L85 PathProgramCache]: Analyzing trace with hash -891994195, now seen corresponding path program 1 times [2024-11-09 09:59:55,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:59:55,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929387122] [2024-11-09 09:59:55,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:55,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:59:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:56,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 09:59:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:56,455 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-09 09:59:56,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:59:56,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929387122] [2024-11-09 09:59:56,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929387122] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:59:56,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:59:56,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-09 09:59:56,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070617558] [2024-11-09 09:59:56,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:59:56,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 09:59:56,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:59:56,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 09:59:56,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-11-09 09:59:56,457 INFO L87 Difference]: Start difference. First operand 1357 states and 1709 transitions. Second operand has 17 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 states have internal predecessors, (104), 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-09 09:59:58,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 09:59:58,036 INFO L93 Difference]: Finished difference Result 1396 states and 1754 transitions. [2024-11-09 09:59:58,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 09:59:58,036 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 states have internal predecessors, (104), 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 106 [2024-11-09 09:59:58,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 09:59:58,038 INFO L225 Difference]: With dead ends: 1396 [2024-11-09 09:59:58,038 INFO L226 Difference]: Without dead ends: 1396 [2024-11-09 09:59:58,039 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2024-11-09 09:59:58,039 INFO L432 NwaCegarLoop]: 497 mSDtfsCounter, 747 mSDsluCounter, 5316 mSDsCounter, 0 mSdLazyCounter, 3659 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 5813 SdHoareTripleChecker+Invalid, 3675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 09:59:58,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 5813 Invalid, 3675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3659 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 09:59:58,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2024-11-09 09:59:58,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1392. [2024-11-09 09:59:58,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 1154 states have (on average 1.5043327556325823) internal successors, (1736), 1382 states have internal predecessors, (1736), 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-09 09:59:58,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 1748 transitions. [2024-11-09 09:59:58,049 INFO L78 Accepts]: Start accepts. Automaton has 1392 states and 1748 transitions. Word has length 106 [2024-11-09 09:59:58,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 09:59:58,050 INFO L471 AbstractCegarLoop]: Abstraction has 1392 states and 1748 transitions. [2024-11-09 09:59:58,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 6.933333333333334) internal successors, (104), 16 states have internal predecessors, (104), 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-09 09:59:58,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1392 states and 1748 transitions. [2024-11-09 09:59:58,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-09 09:59:58,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 09:59:58,051 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-09 09:59:58,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-09 09:59:58,051 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 417 more)] === [2024-11-09 09:59:58,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 09:59:58,052 INFO L85 PathProgramCache]: Analyzing trace with hash -891994194, now seen corresponding path program 1 times [2024-11-09 09:59:58,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 09:59:58,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126596542] [2024-11-09 09:59:58,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 09:59:58,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 09:59:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:59,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-09 09:59:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 09:59:59,164 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-09 09:59:59,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 09:59:59,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126596542] [2024-11-09 09:59:59,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126596542] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 09:59:59,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 09:59:59,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-09 09:59:59,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799734071] [2024-11-09 09:59:59,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 09:59:59,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 09:59:59,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 09:59:59,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 09:59:59,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2024-11-09 09:59:59,167 INFO L87 Difference]: Start difference. First operand 1392 states and 1748 transitions. Second operand has 18 states, 16 states have (on average 6.5) internal successors, (104), 17 states have internal predecessors, (104), 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)