./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_remove_all.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_remove_all.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 b594cdd667b896d6ce097f6fd96950290806f015d929f3b2b06ffea35d861f89 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 18:14:39,060 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 18:14:39,129 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-14 18:14:39,136 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 18:14:39,136 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 18:14:39,172 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 18:14:39,172 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 18:14:39,173 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 18:14:39,174 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 18:14:39,175 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 18:14:39,175 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 18:14:39,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 18:14:39,176 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 18:14:39,177 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 18:14:39,178 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 18:14:39,178 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 18:14:39,179 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 18:14:39,179 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 18:14:39,180 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 18:14:39,181 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 18:14:39,184 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 18:14:39,185 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 18:14:39,185 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-14 18:14:39,185 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 18:14:39,185 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 18:14:39,186 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 18:14:39,186 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 18:14:39,186 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 18:14:39,186 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 18:14:39,186 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 18:14:39,187 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 18:14:39,187 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 18:14:39,187 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 18:14:39,187 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 18:14:39,188 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 18:14:39,188 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 18:14:39,190 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 18:14:39,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 18:14:39,190 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 18:14:39,190 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 18:14:39,191 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 18:14:39,191 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 18:14:39,191 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 -> b594cdd667b896d6ce097f6fd96950290806f015d929f3b2b06ffea35d861f89 [2024-10-14 18:14:39,464 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 18:14:39,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 18:14:39,494 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 18:14:39,495 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 18:14:39,496 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 18:14:39,497 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_remove_all.i [2024-10-14 18:14:41,064 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 18:14:41,289 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 18:14:41,290 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_remove_all.i [2024-10-14 18:14:41,309 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/944997e02/ce3db41e855a4fdc9668d91765923e46/FLAGfec658dfe [2024-10-14 18:14:41,630 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/944997e02/ce3db41e855a4fdc9668d91765923e46 [2024-10-14 18:14:41,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 18:14:41,633 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 18:14:41,634 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 18:14:41,634 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 18:14:41,639 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 18:14:41,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:14:41" (1/1) ... [2024-10-14 18:14:41,640 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@657e609d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:41, skipping insertion in model container [2024-10-14 18:14:41,641 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 06:14:41" (1/1) ... [2024-10-14 18:14:41,684 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 18:14:41,990 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:14:41,998 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 18:14:42,037 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 18:14:42,072 INFO L204 MainTranslator]: Completed translation [2024-10-14 18:14:42,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:42 WrapperNode [2024-10-14 18:14:42,073 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 18:14:42,074 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 18:14:42,074 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 18:14:42,075 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 18:14:42,082 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:42" (1/1) ... [2024-10-14 18:14:42,095 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:42" (1/1) ... [2024-10-14 18:14:42,119 INFO L138 Inliner]: procedures = 126, calls = 32, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 83 [2024-10-14 18:14:42,120 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 18:14:42,120 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 18:14:42,121 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 18:14:42,121 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 18:14:42,131 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:42" (1/1) ... [2024-10-14 18:14:42,132 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:42" (1/1) ... [2024-10-14 18:14:42,135 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:42" (1/1) ... [2024-10-14 18:14:42,152 INFO L175 MemorySlicer]: Split 13 memory accesses to 3 slices as follows [2, 6, 5]. 46 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 6 writes are split as follows [0, 5, 1]. [2024-10-14 18:14:42,152 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:42" (1/1) ... [2024-10-14 18:14:42,152 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:42" (1/1) ... [2024-10-14 18:14:42,162 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:42" (1/1) ... [2024-10-14 18:14:42,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:42" (1/1) ... [2024-10-14 18:14:42,167 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:42" (1/1) ... [2024-10-14 18:14:42,169 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:42" (1/1) ... [2024-10-14 18:14:42,171 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 18:14:42,173 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 18:14:42,173 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 18:14:42,173 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 18:14:42,174 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:42" (1/1) ... [2024-10-14 18:14:42,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 18:14:42,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:14:42,214 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-10-14 18:14:42,220 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-10-14 18:14:42,273 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-10-14 18:14:42,274 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-10-14 18:14:42,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 18:14:42,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 18:14:42,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 18:14:42,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 18:14:42,275 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 18:14:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 18:14:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 18:14:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 18:14:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 18:14:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 18:14:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 18:14:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 18:14:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 18:14:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-14 18:14:42,276 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-14 18:14:42,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-10-14 18:14:42,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 18:14:42,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 18:14:42,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 18:14:42,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 18:14:42,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 18:14:42,467 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 18:14:42,469 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 18:14:42,492 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-10-14 18:14:42,727 INFO L? ?]: Removed 62 outVars from TransFormulas that were not future-live. [2024-10-14 18:14:42,728 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 18:14:42,772 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 18:14:42,773 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 18:14:42,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:14:42 BoogieIcfgContainer [2024-10-14 18:14:42,774 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 18:14:42,776 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 18:14:42,776 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 18:14:42,780 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 18:14:42,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 06:14:41" (1/3) ... [2024-10-14 18:14:42,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5547a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:14:42, skipping insertion in model container [2024-10-14 18:14:42,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 06:14:42" (2/3) ... [2024-10-14 18:14:42,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a5547a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 06:14:42, skipping insertion in model container [2024-10-14 18:14:42,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 06:14:42" (3/3) ... [2024-10-14 18:14:42,784 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2n_remove_all.i [2024-10-14 18:14:42,801 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 18:14:42,802 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2024-10-14 18:14:42,851 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 18:14:42,862 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;@1f583ca8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 18:14:42,863 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2024-10-14 18:14:42,869 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 53 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:14:42,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 18:14:42,876 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:42,876 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 18:14:42,877 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-14 18:14:42,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:42,884 INFO L85 PathProgramCache]: Analyzing trace with hash 4514524, now seen corresponding path program 1 times [2024-10-14 18:14:42,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:42,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856310134] [2024-10-14 18:14:42,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:42,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:43,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:43,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:43,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:43,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856310134] [2024-10-14 18:14:43,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856310134] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:14:43,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:14:43,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:14:43,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933588189] [2024-10-14 18:14:43,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:14:43,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:14:43,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:43,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:14:43,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:14:43,180 INFO L87 Difference]: Start difference. First operand has 55 states, 28 states have (on average 2.2142857142857144) internal successors, (62), 53 states have internal predecessors, (62), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-10-14 18:14:43,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:43,286 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2024-10-14 18:14:43,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:14:43,293 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-10-14 18:14:43,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:43,304 INFO L225 Difference]: With dead ends: 51 [2024-10-14 18:14:43,304 INFO L226 Difference]: Without dead ends: 47 [2024-10-14 18:14:43,306 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-10-14 18:14:43,310 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 9 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:43,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 57 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:14:43,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-10-14 18:14:43,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-10-14 18:14:43,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 25 states have (on average 2.0) internal successors, (50), 46 states have internal predecessors, (50), 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-10-14 18:14:43,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 50 transitions. [2024-10-14 18:14:43,351 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 50 transitions. Word has length 4 [2024-10-14 18:14:43,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:43,352 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 50 transitions. [2024-10-14 18:14:43,352 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-10-14 18:14:43,353 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 50 transitions. [2024-10-14 18:14:43,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 18:14:43,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:43,353 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 18:14:43,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 18:14:43,355 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-14 18:14:43,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:43,356 INFO L85 PathProgramCache]: Analyzing trace with hash 4514525, now seen corresponding path program 1 times [2024-10-14 18:14:43,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:43,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13617816] [2024-10-14 18:14:43,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:43,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:43,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:43,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:43,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:43,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13617816] [2024-10-14 18:14:43,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13617816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:14:43,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:14:43,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:14:43,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549902222] [2024-10-14 18:14:43,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:14:43,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:14:43,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:43,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:14:43,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:14:43,485 INFO L87 Difference]: Start difference. First operand 47 states and 50 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-10-14 18:14:43,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:43,537 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2024-10-14 18:14:43,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:14:43,538 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-10-14 18:14:43,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:43,539 INFO L225 Difference]: With dead ends: 44 [2024-10-14 18:14:43,539 INFO L226 Difference]: Without dead ends: 44 [2024-10-14 18:14:43,539 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-10-14 18:14:43,541 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 8 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:43,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 56 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 18:14:43,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-14 18:14:43,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-14 18:14:43,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 25 states have (on average 1.88) internal successors, (47), 43 states have internal predecessors, (47), 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-10-14 18:14:43,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 47 transitions. [2024-10-14 18:14:43,548 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 47 transitions. Word has length 4 [2024-10-14 18:14:43,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:43,548 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 47 transitions. [2024-10-14 18:14:43,549 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-10-14 18:14:43,549 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 47 transitions. [2024-10-14 18:14:43,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-14 18:14:43,549 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:43,549 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-14 18:14:43,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 18:14:43,550 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-14 18:14:43,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:43,550 INFO L85 PathProgramCache]: Analyzing trace with hash 139988715, now seen corresponding path program 1 times [2024-10-14 18:14:43,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:43,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231432759] [2024-10-14 18:14:43,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:43,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:43,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:43,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:43,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231432759] [2024-10-14 18:14:43,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231432759] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:14:43,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:14:43,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:14:43,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375487643] [2024-10-14 18:14:43,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:14:43,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:14:43,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:43,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:14:43,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:14:43,628 INFO L87 Difference]: Start difference. First operand 44 states and 47 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:14:43,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:43,657 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2024-10-14 18:14:43,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:14:43,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-14 18:14:43,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:43,659 INFO L225 Difference]: With dead ends: 54 [2024-10-14 18:14:43,660 INFO L226 Difference]: Without dead ends: 54 [2024-10-14 18:14:43,660 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-10-14 18:14:43,662 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 10 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:43,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 79 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 18:14:43,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-14 18:14:43,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2024-10-14 18:14:43,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 44 states have internal predecessors, (48), 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-10-14 18:14:43,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2024-10-14 18:14:43,670 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 5 [2024-10-14 18:14:43,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:43,670 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2024-10-14 18:14:43,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:14:43,671 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2024-10-14 18:14:43,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-14 18:14:43,672 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:43,672 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:43,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 18:14:43,673 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-14 18:14:43,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:43,674 INFO L85 PathProgramCache]: Analyzing trace with hash -1155614624, now seen corresponding path program 1 times [2024-10-14 18:14:43,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:43,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301889849] [2024-10-14 18:14:43,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:43,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:43,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:43,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:43,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301889849] [2024-10-14 18:14:43,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [301889849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:14:43,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:14:43,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 18:14:43,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324771010] [2024-10-14 18:14:43,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:14:43,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 18:14:43,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:43,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 18:14:43,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 18:14:43,754 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:14:43,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:43,787 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2024-10-14 18:14:43,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 18:14:43,790 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-14 18:14:43,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:43,791 INFO L225 Difference]: With dead ends: 50 [2024-10-14 18:14:43,791 INFO L226 Difference]: Without dead ends: 50 [2024-10-14 18:14:43,791 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-10-14 18:14:43,792 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:43,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 18:14:43,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-14 18:14:43,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-14 18:14:43,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 49 states have internal predecessors, (53), 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-10-14 18:14:43,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2024-10-14 18:14:43,802 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 8 [2024-10-14 18:14:43,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:43,802 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2024-10-14 18:14:43,803 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:14:43,803 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2024-10-14 18:14:43,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-14 18:14:43,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:43,803 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:43,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 18:14:43,804 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-14 18:14:43,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:43,806 INFO L85 PathProgramCache]: Analyzing trace with hash 723675860, now seen corresponding path program 1 times [2024-10-14 18:14:43,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:43,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752907535] [2024-10-14 18:14:43,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:43,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:43,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:43,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:43,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752907535] [2024-10-14 18:14:43,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752907535] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:14:43,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764462553] [2024-10-14 18:14:43,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:43,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:43,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:14:43,950 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-10-14 18:14:43,951 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-10-14 18:14:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:44,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 18:14:44,062 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:14:44,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:44,117 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:14:44,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:44,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764462553] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:14:44,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:14:44,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2024-10-14 18:14:44,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649894570] [2024-10-14 18:14:44,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:14:44,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:14:44,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:44,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:14:44,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:14:44,153 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:14:44,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:44,179 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2024-10-14 18:14:44,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:14:44,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-14 18:14:44,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:44,180 INFO L225 Difference]: With dead ends: 52 [2024-10-14 18:14:44,180 INFO L226 Difference]: Without dead ends: 52 [2024-10-14 18:14:44,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:14:44,181 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 10 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:44,182 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 79 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 18:14:44,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-14 18:14:44,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-14 18:14:44,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 33 states have (on average 1.6666666666666667) internal successors, (55), 51 states have internal predecessors, (55), 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-10-14 18:14:44,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2024-10-14 18:14:44,190 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 12 [2024-10-14 18:14:44,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:44,190 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2024-10-14 18:14:44,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:14:44,190 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2024-10-14 18:14:44,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 18:14:44,190 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:44,191 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-14 18:14:44,209 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 18:14:44,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:44,392 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-14 18:14:44,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:44,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1440507863, now seen corresponding path program 1 times [2024-10-14 18:14:44,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:44,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561300150] [2024-10-14 18:14:44,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:44,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:44,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:44,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:44,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561300150] [2024-10-14 18:14:44,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561300150] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:14:44,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071374648] [2024-10-14 18:14:44,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:44,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:44,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:14:44,709 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-10-14 18:14:44,710 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-10-14 18:14:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:44,818 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 18:14:44,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:14:44,853 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-10-14 18:14:44,884 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-14 18:14:44,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-14 18:14:44,904 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:44,904 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:14:44,938 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:44,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071374648] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:14:44,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:14:44,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-10-14 18:14:44,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499215133] [2024-10-14 18:14:44,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:14:44,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:14:44,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:44,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:14:44,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:14:44,942 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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-10-14 18:14:45,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:45,042 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2024-10-14 18:14:45,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:14:45,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 18:14:45,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:45,044 INFO L225 Difference]: With dead ends: 51 [2024-10-14 18:14:45,044 INFO L226 Difference]: Without dead ends: 51 [2024-10-14 18:14:45,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-14 18:14:45,048 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 4 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:45,048 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 82 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:14:45,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-14 18:14:45,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-14 18:14:45,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 33 states have (on average 1.6363636363636365) internal successors, (54), 50 states have internal predecessors, (54), 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-10-14 18:14:45,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2024-10-14 18:14:45,055 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 15 [2024-10-14 18:14:45,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:45,055 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2024-10-14 18:14:45,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 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-10-14 18:14:45,055 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2024-10-14 18:14:45,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-14 18:14:45,056 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:45,056 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-14 18:14:45,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 18:14:45,256 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,SelfDestructingSolverStorable5 [2024-10-14 18:14:45,257 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-14 18:14:45,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:45,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1440507864, now seen corresponding path program 1 times [2024-10-14 18:14:45,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:45,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625858932] [2024-10-14 18:14:45,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:45,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:45,528 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:45,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:45,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625858932] [2024-10-14 18:14:45,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625858932] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:14:45,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1881542554] [2024-10-14 18:14:45,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:45,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:45,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:14:45,532 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-10-14 18:14:45,533 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-10-14 18:14:45,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:45,642 INFO L255 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 18:14:45,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:14:45,661 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-10-14 18:14:45,667 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-10-14 18:14:45,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:14:45,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-10-14 18:14:45,774 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:14:45,775 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-10-14 18:14:45,832 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:45,832 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:14:46,139 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:46,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1881542554] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:14:46,140 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:14:46,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 11 [2024-10-14 18:14:46,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702146197] [2024-10-14 18:14:46,140 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:14:46,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 18:14:46,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:46,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 18:14:46,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-10-14 18:14:46,145 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 12 states have internal predecessors, (43), 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-10-14 18:14:46,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:46,349 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2024-10-14 18:14:46,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:14:46,350 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 12 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-14 18:14:46,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:46,351 INFO L225 Difference]: With dead ends: 50 [2024-10-14 18:14:46,351 INFO L226 Difference]: Without dead ends: 50 [2024-10-14 18:14:46,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-14 18:14:46,352 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 9 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:46,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 147 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 18:14:46,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-14 18:14:46,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-14 18:14:46,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.606060606060606) internal successors, (53), 49 states have internal predecessors, (53), 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-10-14 18:14:46,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2024-10-14 18:14:46,359 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 15 [2024-10-14 18:14:46,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:46,360 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2024-10-14 18:14:46,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 12 states have internal predecessors, (43), 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-10-14 18:14:46,360 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2024-10-14 18:14:46,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 18:14:46,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:46,361 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-14 18:14:46,375 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 18:14:46,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:46,565 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-14 18:14:46,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:46,566 INFO L85 PathProgramCache]: Analyzing trace with hash -939686197, now seen corresponding path program 2 times [2024-10-14 18:14:46,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:46,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004561340] [2024-10-14 18:14:46,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:46,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:46,632 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:46,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:46,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004561340] [2024-10-14 18:14:46,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004561340] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:14:46,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [142498337] [2024-10-14 18:14:46,633 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 18:14:46,633 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:46,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:14:46,635 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-10-14 18:14:46,637 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-10-14 18:14:46,721 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-14 18:14:46,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 18:14:46,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-14 18:14:46,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:14:46,761 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 18:14:46,761 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:14:46,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [142498337] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:14:46,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 18:14:46,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-10-14 18:14:46,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129852920] [2024-10-14 18:14:46,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:14:46,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:14:46,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:46,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:14:46,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 18:14:46,765 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-14 18:14:46,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:46,792 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2024-10-14 18:14:46,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 18:14:46,794 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-14 18:14:46,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:46,794 INFO L225 Difference]: With dead ends: 73 [2024-10-14 18:14:46,794 INFO L226 Difference]: Without dead ends: 73 [2024-10-14 18:14:46,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 18:14:46,795 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 25 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:46,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 106 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 18:14:46,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-14 18:14:46,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 51. [2024-10-14 18:14:46,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.588235294117647) internal successors, (54), 50 states have internal predecessors, (54), 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-10-14 18:14:46,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2024-10-14 18:14:46,805 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 19 [2024-10-14 18:14:46,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:46,805 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2024-10-14 18:14:46,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 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-10-14 18:14:46,805 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2024-10-14 18:14:46,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-14 18:14:46,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:46,806 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-10-14 18:14:46,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-14 18:14:47,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:47,007 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-14 18:14:47,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:47,008 INFO L85 PathProgramCache]: Analyzing trace with hash -939686170, now seen corresponding path program 1 times [2024-10-14 18:14:47,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:47,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112071398] [2024-10-14 18:14:47,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:47,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:47,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:47,074 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:47,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:47,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112071398] [2024-10-14 18:14:47,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112071398] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:14:47,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504695967] [2024-10-14 18:14:47,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:47,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:47,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:14:47,078 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-10-14 18:14:47,079 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-10-14 18:14:47,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:47,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 18:14:47,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:14:47,217 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:47,218 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:14:47,239 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:47,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504695967] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:14:47,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:14:47,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2024-10-14 18:14:47,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597588090] [2024-10-14 18:14:47,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:14:47,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:14:47,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:47,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:14:47,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 18:14:47,242 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:14:47,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:47,278 INFO L93 Difference]: Finished difference Result 51 states and 53 transitions. [2024-10-14 18:14:47,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:14:47,279 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-14 18:14:47,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:47,280 INFO L225 Difference]: With dead ends: 51 [2024-10-14 18:14:47,280 INFO L226 Difference]: Without dead ends: 51 [2024-10-14 18:14:47,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 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-10-14 18:14:47,281 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 4 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:47,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 96 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 18:14:47,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-14 18:14:47,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-14 18:14:47,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.5588235294117647) internal successors, (53), 50 states have internal predecessors, (53), 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-10-14 18:14:47,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2024-10-14 18:14:47,285 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 19 [2024-10-14 18:14:47,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:47,285 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2024-10-14 18:14:47,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:14:47,286 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2024-10-14 18:14:47,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 18:14:47,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:47,286 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:47,306 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 18:14:47,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:47,492 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-14 18:14:47,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:47,493 INFO L85 PathProgramCache]: Analyzing trace with hash 642849539, now seen corresponding path program 1 times [2024-10-14 18:14:47,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:47,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216988778] [2024-10-14 18:14:47,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:47,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:47,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:47,665 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:14:47,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:47,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216988778] [2024-10-14 18:14:47,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216988778] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:14:47,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074631605] [2024-10-14 18:14:47,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:47,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:47,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:14:47,669 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-10-14 18:14:47,680 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-10-14 18:14:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:47,792 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-14 18:14:47,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:14:47,802 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-10-14 18:14:47,822 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-14 18:14:47,823 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 19 treesize of output 16 [2024-10-14 18:14:47,844 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-14 18:14:47,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-14 18:14:47,865 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 18:14:47,866 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:14:47,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074631605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:14:47,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 18:14:47,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2024-10-14 18:14:47,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025651480] [2024-10-14 18:14:47,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:14:47,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 18:14:47,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:47,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 18:14:47,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-10-14 18:14:47,868 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-10-14 18:14:47,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:47,933 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2024-10-14 18:14:47,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:14:47,933 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 20 [2024-10-14 18:14:47,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:47,934 INFO L225 Difference]: With dead ends: 67 [2024-10-14 18:14:47,934 INFO L226 Difference]: Without dead ends: 67 [2024-10-14 18:14:47,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:14:47,935 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 50 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:47,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 43 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:14:47,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-14 18:14:47,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2024-10-14 18:14:47,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 35 states have (on average 1.542857142857143) internal successors, (54), 50 states have internal predecessors, (54), 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-10-14 18:14:47,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2024-10-14 18:14:47,938 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 20 [2024-10-14 18:14:47,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:47,939 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2024-10-14 18:14:47,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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-10-14 18:14:47,939 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2024-10-14 18:14:47,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 18:14:47,939 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:47,940 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:47,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-14 18:14:48,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:48,144 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-14 18:14:48,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:48,145 INFO L85 PathProgramCache]: Analyzing trace with hash 642849540, now seen corresponding path program 1 times [2024-10-14 18:14:48,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:48,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148161794] [2024-10-14 18:14:48,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:48,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:48,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:48,497 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:48,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:48,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148161794] [2024-10-14 18:14:48,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148161794] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:14:48,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112188681] [2024-10-14 18:14:48,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:48,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:48,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:14:48,500 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-10-14 18:14:48,503 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-10-14 18:14:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:48,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-10-14 18:14:48,637 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:14:48,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 8 treesize of output 1 [2024-10-14 18:14:48,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:14:48,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-10-14 18:14:48,726 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:14:48,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-10-14 18:14:48,768 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:14:48,769 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:14:52,993 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_36| Int)) (or (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_35| Int) (v_ArrVal_614 Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_create_~new_head~0#1.base_35| 1)) (forall ((v_ArrVal_615 Int)) (<= (+ |c_ULTIMATE.start_main_~#s~0#1.offset| 4) (select (store (store |c_#length| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_36| v_ArrVal_614) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_35| v_ArrVal_615) |c_ULTIMATE.start_main_~#s~0#1.base|))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_create_~new_head~0#1.base_36| 1)))) (<= 0 |c_ULTIMATE.start_main_~#s~0#1.offset|)) is different from false [2024-10-14 18:14:52,995 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-14 18:14:52,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112188681] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:14:52,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:14:52,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 4] total 10 [2024-10-14 18:14:52,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202445863] [2024-10-14 18:14:52,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:14:52,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 18:14:52,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:52,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 18:14:52,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=75, Unknown=1, NotChecked=18, Total=132 [2024-10-14 18:14:52,996 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 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-10-14 18:14:53,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:53,141 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2024-10-14 18:14:53,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 18:14:53,141 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-14 18:14:53,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:53,142 INFO L225 Difference]: With dead ends: 61 [2024-10-14 18:14:53,142 INFO L226 Difference]: Without dead ends: 61 [2024-10-14 18:14:53,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=65, Invalid=120, Unknown=1, NotChecked=24, Total=210 [2024-10-14 18:14:53,143 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 162 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:53,143 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 57 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 124 Invalid, 0 Unknown, 53 Unchecked, 0.1s Time] [2024-10-14 18:14:53,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-14 18:14:53,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 47. [2024-10-14 18:14:53,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 35 states have (on average 1.4) internal successors, (49), 46 states have internal predecessors, (49), 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-10-14 18:14:53,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2024-10-14 18:14:53,146 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 20 [2024-10-14 18:14:53,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:53,147 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2024-10-14 18:14:53,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 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-10-14 18:14:53,147 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2024-10-14 18:14:53,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 18:14:53,148 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:53,148 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:53,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-14 18:14:53,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:53,353 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-14 18:14:53,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:53,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1546500741, now seen corresponding path program 1 times [2024-10-14 18:14:53,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:53,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580270097] [2024-10-14 18:14:53,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:53,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:53,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:53,483 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 18:14:53,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:53,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580270097] [2024-10-14 18:14:53,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580270097] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:14:53,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:14:53,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 18:14:53,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554731765] [2024-10-14 18:14:53,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:14:53,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:14:53,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:53,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:14:53,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:14:53,485 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 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-10-14 18:14:53,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:53,616 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2024-10-14 18:14:53,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 18:14:53,616 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 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 21 [2024-10-14 18:14:53,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:53,617 INFO L225 Difference]: With dead ends: 60 [2024-10-14 18:14:53,617 INFO L226 Difference]: Without dead ends: 60 [2024-10-14 18:14:53,617 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-14 18:14:53,618 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:53,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 79 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:14:53,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-14 18:14:53,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 48. [2024-10-14 18:14:53,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.4166666666666667) internal successors, (51), 47 states have internal predecessors, (51), 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-10-14 18:14:53,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2024-10-14 18:14:53,620 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 21 [2024-10-14 18:14:53,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:53,621 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2024-10-14 18:14:53,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 7 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-10-14 18:14:53,621 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2024-10-14 18:14:53,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 18:14:53,622 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:53,622 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:53,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 18:14:53,622 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-14 18:14:53,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:53,623 INFO L85 PathProgramCache]: Analyzing trace with hash -1546500740, now seen corresponding path program 1 times [2024-10-14 18:14:53,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:53,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220556297] [2024-10-14 18:14:53,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:53,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:53,827 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:14:53,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:53,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220556297] [2024-10-14 18:14:53,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220556297] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:14:53,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:14:53,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 18:14:53,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884612177] [2024-10-14 18:14:53,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:14:53,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:14:53,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:53,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:14:53,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:14:53,829 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 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-10-14 18:14:53,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:53,968 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2024-10-14 18:14:53,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 18:14:53,969 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 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-10-14 18:14:53,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:53,969 INFO L225 Difference]: With dead ends: 61 [2024-10-14 18:14:53,969 INFO L226 Difference]: Without dead ends: 61 [2024-10-14 18:14:53,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-14 18:14:53,970 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 36 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:53,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 111 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:14:53,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-10-14 18:14:53,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 48. [2024-10-14 18:14:53,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 47 states have internal predecessors, (50), 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-10-14 18:14:53,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2024-10-14 18:14:53,973 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 21 [2024-10-14 18:14:53,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:53,973 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2024-10-14 18:14:53,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 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-10-14 18:14:53,973 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2024-10-14 18:14:53,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 18:14:53,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:53,974 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:53,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 18:14:53,974 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-14 18:14:53,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:53,975 INFO L85 PathProgramCache]: Analyzing trace with hash -128467911, now seen corresponding path program 1 times [2024-10-14 18:14:53,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:53,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171894706] [2024-10-14 18:14:53,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:53,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:54,464 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:54,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:54,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171894706] [2024-10-14 18:14:54,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171894706] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:14:54,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296493689] [2024-10-14 18:14:54,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:54,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:54,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:14:54,467 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-10-14 18:14:54,469 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-10-14 18:14:54,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:54,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-14 18:14:54,663 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:14:54,684 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-10-14 18:14:54,756 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:14:54,757 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-10-14 18:14:54,798 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 11 treesize of output 7 [2024-10-14 18:14:54,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-14 18:14:54,855 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:14:54,856 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 34 treesize of output 33 [2024-10-14 18:14:55,007 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 37 treesize of output 21 [2024-10-14 18:14:55,044 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 25 treesize of output 13 [2024-10-14 18:14:55,048 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:55,049 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:14:55,131 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 28 treesize of output 20 [2024-10-14 18:14:55,134 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 24 treesize of output 16 [2024-10-14 18:14:55,194 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-10-14 18:14:55,194 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-10-14 18:14:55,198 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_813 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_813) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2024-10-14 18:14:55,209 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_813 (Array Int Int)) (v_ArrVal_811 Int)) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_811)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_813) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) is different from false [2024-10-14 18:14:55,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:55,220 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2024-10-14 18:14:55,224 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 36 treesize of output 24 [2024-10-14 18:14:55,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-10-14 18:14:55,297 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-14 18:14:55,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296493689] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:14:55,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:14:55,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 31 [2024-10-14 18:14:55,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058373406] [2024-10-14 18:14:55,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:14:55,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-14 18:14:55,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:55,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-14 18:14:55,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=778, Unknown=2, NotChecked=114, Total=992 [2024-10-14 18:14:55,302 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 32 states, 31 states have (on average 2.064516129032258) internal successors, (64), 32 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:14:55,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:55,964 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2024-10-14 18:14:55,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-14 18:14:55,964 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.064516129032258) internal successors, (64), 32 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-14 18:14:55,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:55,965 INFO L225 Difference]: With dead ends: 71 [2024-10-14 18:14:55,965 INFO L226 Difference]: Without dead ends: 71 [2024-10-14 18:14:55,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=227, Invalid=1339, Unknown=2, NotChecked=154, Total=1722 [2024-10-14 18:14:55,966 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 119 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:55,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 172 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 555 Invalid, 0 Unknown, 134 Unchecked, 0.3s Time] [2024-10-14 18:14:55,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-14 18:14:55,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 50. [2024-10-14 18:14:55,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 49 states have internal predecessors, (54), 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-10-14 18:14:55,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2024-10-14 18:14:55,973 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 23 [2024-10-14 18:14:55,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:55,973 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2024-10-14 18:14:55,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.064516129032258) internal successors, (64), 32 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:14:55,973 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2024-10-14 18:14:55,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-14 18:14:55,974 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:55,974 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:55,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-14 18:14:56,174 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,SelfDestructingSolverStorable13 [2024-10-14 18:14:56,176 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-14 18:14:56,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:56,176 INFO L85 PathProgramCache]: Analyzing trace with hash -128467910, now seen corresponding path program 1 times [2024-10-14 18:14:56,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:56,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799901663] [2024-10-14 18:14:56,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:56,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:56,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:56,880 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:56,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:56,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799901663] [2024-10-14 18:14:56,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799901663] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:14:56,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [747327807] [2024-10-14 18:14:56,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:56,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:14:56,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:14:56,883 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:14:56,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-14 18:14:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:57,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-14 18:14:57,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:14:57,108 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-10-14 18:14:57,114 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-10-14 18:14:57,222 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:14:57,222 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-10-14 18:14:57,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-10-14 18:14:57,288 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 11 treesize of output 7 [2024-10-14 18:14:57,294 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 11 treesize of output 7 [2024-10-14 18:14:57,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-14 18:14:57,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-14 18:14:57,416 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:14:57,417 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 50 treesize of output 45 [2024-10-14 18:14:57,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 16 [2024-10-14 18:14:57,639 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 59 treesize of output 35 [2024-10-14 18:14:57,686 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 25 treesize of output 13 [2024-10-14 18:14:57,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-14 18:14:57,716 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:14:57,716 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:14:57,852 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 64 treesize of output 48 [2024-10-14 18:14:57,855 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 52 treesize of output 36 [2024-10-14 18:14:57,999 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2 0))) (.cse1 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_922 (Array Int Int)) (v_ArrVal_921 (Array Int Int)) (v_ArrVal_920 Int)) (<= (+ (select (select (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_921) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse2 v_ArrVal_920)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_922) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1)))) (forall ((v_ArrVal_921 (Array Int Int))) (<= 0 (+ (select (select (store .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_921) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse1) 8)))))) is different from false [2024-10-14 18:14:58,010 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:58,010 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 61 [2024-10-14 18:14:58,018 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:58,019 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 46 [2024-10-14 18:14:58,021 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 62 treesize of output 50 [2024-10-14 18:14:58,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:58,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 106 treesize of output 82 [2024-10-14 18:14:58,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-14 18:14:58,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-14 18:14:58,051 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:58,052 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2024-10-14 18:14:58,054 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:14:58,057 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:14:58,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 14 [2024-10-14 18:14:58,286 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-10-14 18:14:58,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [747327807] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:14:58,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:14:58,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 35 [2024-10-14 18:14:58,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346264784] [2024-10-14 18:14:58,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:14:58,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-14 18:14:58,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:58,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-14 18:14:58,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1071, Unknown=17, NotChecked=66, Total=1260 [2024-10-14 18:14:58,289 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 36 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 36 states have internal predecessors, (68), 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-10-14 18:14:59,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:59,478 INFO L93 Difference]: Finished difference Result 74 states and 77 transitions. [2024-10-14 18:14:59,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 18:14:59,479 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 36 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-14 18:14:59,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:59,480 INFO L225 Difference]: With dead ends: 74 [2024-10-14 18:14:59,480 INFO L226 Difference]: Without dead ends: 74 [2024-10-14 18:14:59,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=341, Invalid=2195, Unknown=18, NotChecked=98, Total=2652 [2024-10-14 18:14:59,481 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 124 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:59,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 428 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 759 Invalid, 0 Unknown, 71 Unchecked, 0.5s Time] [2024-10-14 18:14:59,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-14 18:14:59,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 50. [2024-10-14 18:14:59,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 38 states have (on average 1.394736842105263) internal successors, (53), 49 states have internal predecessors, (53), 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-10-14 18:14:59,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2024-10-14 18:14:59,484 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 23 [2024-10-14 18:14:59,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:59,484 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2024-10-14 18:14:59,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 36 states have internal predecessors, (68), 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-10-14 18:14:59,484 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2024-10-14 18:14:59,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 18:14:59,485 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:59,485 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:59,503 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-14 18:14:59,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-14 18:14:59,686 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-14 18:14:59,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:59,686 INFO L85 PathProgramCache]: Analyzing trace with hash 312467091, now seen corresponding path program 1 times [2024-10-14 18:14:59,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:59,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839540264] [2024-10-14 18:14:59,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:59,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:14:59,794 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:14:59,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:14:59,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839540264] [2024-10-14 18:14:59,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839540264] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:14:59,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:14:59,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 18:14:59,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206517467] [2024-10-14 18:14:59,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:14:59,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:14:59,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:14:59,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:14:59,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:14:59,797 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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-10-14 18:14:59,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:14:59,881 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2024-10-14 18:14:59,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 18:14:59,881 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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 24 [2024-10-14 18:14:59,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:14:59,882 INFO L225 Difference]: With dead ends: 58 [2024-10-14 18:14:59,882 INFO L226 Difference]: Without dead ends: 58 [2024-10-14 18:14:59,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-14 18:14:59,883 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 28 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:14:59,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 125 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:14:59,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-10-14 18:14:59,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2024-10-14 18:14:59,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.375) internal successors, (55), 51 states have internal predecessors, (55), 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-10-14 18:14:59,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2024-10-14 18:14:59,885 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 24 [2024-10-14 18:14:59,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:14:59,885 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2024-10-14 18:14:59,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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-10-14 18:14:59,886 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2024-10-14 18:14:59,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-14 18:14:59,886 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:14:59,886 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:14:59,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 18:14:59,887 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-14 18:14:59,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:14:59,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1096545338, now seen corresponding path program 1 times [2024-10-14 18:14:59,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:14:59,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287671132] [2024-10-14 18:14:59,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:14:59,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:14:59,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:00,008 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:15:00,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:00,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287671132] [2024-10-14 18:15:00,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287671132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:15:00,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:15:00,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 18:15:00,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598528196] [2024-10-14 18:15:00,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:15:00,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:15:00,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:00,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:15:00,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:15:00,011 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 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-10-14 18:15:00,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:00,130 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2024-10-14 18:15:00,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 18:15:00,131 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 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 25 [2024-10-14 18:15:00,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:00,132 INFO L225 Difference]: With dead ends: 57 [2024-10-14 18:15:00,133 INFO L226 Difference]: Without dead ends: 57 [2024-10-14 18:15:00,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-14 18:15:00,133 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 27 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:00,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 104 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:15:00,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-14 18:15:00,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2024-10-14 18:15:00,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.3658536585365855) internal successors, (56), 52 states have internal predecessors, (56), 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-10-14 18:15:00,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2024-10-14 18:15:00,136 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 25 [2024-10-14 18:15:00,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:00,136 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2024-10-14 18:15:00,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 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-10-14 18:15:00,136 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2024-10-14 18:15:00,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 18:15:00,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:00,137 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:00,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 18:15:00,137 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-14 18:15:00,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:00,138 INFO L85 PathProgramCache]: Analyzing trace with hash -366832779, now seen corresponding path program 1 times [2024-10-14 18:15:00,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:00,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112324298] [2024-10-14 18:15:00,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:00,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:00,231 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 18:15:00,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:00,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112324298] [2024-10-14 18:15:00,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112324298] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:15:00,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 18:15:00,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 18:15:00,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517110423] [2024-10-14 18:15:00,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:15:00,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 18:15:00,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:00,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 18:15:00,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 18:15:00,233 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:15:00,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:00,293 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2024-10-14 18:15:00,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:15:00,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-14 18:15:00,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:00,294 INFO L225 Difference]: With dead ends: 52 [2024-10-14 18:15:00,294 INFO L226 Difference]: Without dead ends: 52 [2024-10-14 18:15:00,294 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-10-14 18:15:00,295 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 10 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:00,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 66 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:15:00,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-14 18:15:00,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-14 18:15:00,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 41 states have (on average 1.3414634146341464) internal successors, (55), 51 states have internal predecessors, (55), 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-10-14 18:15:00,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2024-10-14 18:15:00,297 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 26 [2024-10-14 18:15:00,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:00,297 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2024-10-14 18:15:00,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 18:15:00,298 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2024-10-14 18:15:00,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 18:15:00,298 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:00,298 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:00,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 18:15:00,299 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-14 18:15:00,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:00,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1513085853, now seen corresponding path program 1 times [2024-10-14 18:15:00,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:00,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891811197] [2024-10-14 18:15:00,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:00,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:00,470 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-14 18:15:00,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:00,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891811197] [2024-10-14 18:15:00,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891811197] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:00,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1189448365] [2024-10-14 18:15:00,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:00,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:00,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:00,474 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:00,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-14 18:15:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:00,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 18:15:00,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:00,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:15:00,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-10-14 18:15:00,707 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 18:15:00,707 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 18:15:00,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1189448365] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 18:15:00,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 18:15:00,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-10-14 18:15:00,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161996106] [2024-10-14 18:15:00,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 18:15:00,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:15:00,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:00,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:15:00,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-10-14 18:15:00,710 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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-10-14 18:15:00,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:00,784 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2024-10-14 18:15:00,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 18:15:00,785 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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 27 [2024-10-14 18:15:00,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:00,785 INFO L225 Difference]: With dead ends: 51 [2024-10-14 18:15:00,786 INFO L226 Difference]: Without dead ends: 51 [2024-10-14 18:15:00,786 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2024-10-14 18:15:00,786 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 42 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:00,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 55 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 18:15:00,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-14 18:15:00,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-14 18:15:00,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 50 states have internal predecessors, (54), 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-10-14 18:15:00,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2024-10-14 18:15:00,788 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 27 [2024-10-14 18:15:00,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:00,789 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2024-10-14 18:15:00,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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-10-14 18:15:00,789 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2024-10-14 18:15:00,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 18:15:00,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:00,790 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:00,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-14 18:15:00,993 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:00,994 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-14 18:15:00,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:00,994 INFO L85 PathProgramCache]: Analyzing trace with hash -1918372248, now seen corresponding path program 1 times [2024-10-14 18:15:00,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:00,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097745220] [2024-10-14 18:15:00,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:00,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:01,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:01,073 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 18:15:01,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:01,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097745220] [2024-10-14 18:15:01,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097745220] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:01,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [713586425] [2024-10-14 18:15:01,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:01,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:01,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:01,076 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:01,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-14 18:15:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:01,255 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 18:15:01,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:01,295 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 18:15:01,295 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:01,332 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 18:15:01,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [713586425] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:15:01,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:15:01,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2024-10-14 18:15:01,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512358377] [2024-10-14 18:15:01,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:01,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 18:15:01,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:01,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 18:15:01,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:15:01,334 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 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-10-14 18:15:01,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:01,359 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2024-10-14 18:15:01,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:15:01,360 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-14 18:15:01,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:01,360 INFO L225 Difference]: With dead ends: 54 [2024-10-14 18:15:01,360 INFO L226 Difference]: Without dead ends: 54 [2024-10-14 18:15:01,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 18:15:01,361 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 19 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:01,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 154 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 18:15:01,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-14 18:15:01,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-14 18:15:01,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 53 states have internal predecessors, (57), 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-10-14 18:15:01,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2024-10-14 18:15:01,363 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 29 [2024-10-14 18:15:01,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:01,364 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2024-10-14 18:15:01,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.285714285714286) internal successors, (44), 6 states have internal predecessors, (44), 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-10-14 18:15:01,364 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2024-10-14 18:15:01,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 18:15:01,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:01,365 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:01,382 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-14 18:15:01,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:01,566 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-14 18:15:01,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:01,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1918372221, now seen corresponding path program 1 times [2024-10-14 18:15:01,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:01,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031197398] [2024-10-14 18:15:01,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:01,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:01,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:01,646 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 18:15:01,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:01,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031197398] [2024-10-14 18:15:01,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031197398] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:01,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441113011] [2024-10-14 18:15:01,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:01,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:01,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:01,649 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:01,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-14 18:15:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:01,807 INFO L255 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-14 18:15:01,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:01,815 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-10-14 18:15:01,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:15:01,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-10-14 18:15:01,855 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-14 18:15:01,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-14 18:15:01,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:15:01,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 14 treesize of output 9 [2024-10-14 18:15:01,939 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-10-14 18:15:01,939 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:03,532 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_51| Int) (v_ArrVal_1389 Int) (|ULTIMATE.start_dll_remove_first_#t~mem8#1.base| Int)) (or (= (select (store (store |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51| 1) |ULTIMATE.start_dll_remove_first_#t~mem8#1.base| v_ArrVal_1389) |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (< |c_#StackHeapBarrier| (+ |ULTIMATE.start_dll_remove_first_#t~mem8#1.base| 1)))) is different from false [2024-10-14 18:15:07,438 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_51| Int) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_52| Int) (v_ArrVal_1387 Int) (v_ArrVal_1389 Int) (|ULTIMATE.start_dll_remove_first_#t~mem8#1.base| Int)) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_dll_create_~new_head~0#1.base_52| 1)) (< |c_#StackHeapBarrier| (+ |ULTIMATE.start_dll_remove_first_#t~mem8#1.base| 1)) (= (select (store (store (store |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_52| v_ArrVal_1387) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_51| 1) |ULTIMATE.start_dll_remove_first_#t~mem8#1.base| v_ArrVal_1389) |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) is different from false [2024-10-14 18:15:07,443 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-10-14 18:15:07,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441113011] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:15:07,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:15:07,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 6] total 10 [2024-10-14 18:15:07,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976365358] [2024-10-14 18:15:07,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:07,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 18:15:07,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:07,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 18:15:07,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=53, Unknown=2, NotChecked=30, Total=110 [2024-10-14 18:15:07,445 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 11 states, 10 states have (on average 7.0) internal successors, (70), 11 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-10-14 18:15:07,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:07,553 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2024-10-14 18:15:07,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 18:15:07,554 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.0) internal successors, (70), 11 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 29 [2024-10-14 18:15:07,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:07,554 INFO L225 Difference]: With dead ends: 52 [2024-10-14 18:15:07,554 INFO L226 Difference]: Without dead ends: 52 [2024-10-14 18:15:07,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=42, Invalid=74, Unknown=2, NotChecked=38, Total=156 [2024-10-14 18:15:07,555 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 52 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:07,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 46 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 69 Invalid, 0 Unknown, 64 Unchecked, 0.1s Time] [2024-10-14 18:15:07,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-14 18:15:07,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-14 18:15:07,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 44 states have (on average 1.25) internal successors, (55), 51 states have internal predecessors, (55), 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-10-14 18:15:07,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2024-10-14 18:15:07,559 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 29 [2024-10-14 18:15:07,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:07,560 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2024-10-14 18:15:07,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.0) internal successors, (70), 11 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-10-14 18:15:07,560 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2024-10-14 18:15:07,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-14 18:15:07,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:07,560 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:07,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-14 18:15:07,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-14 18:15:07,765 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-14 18:15:07,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:07,765 INFO L85 PathProgramCache]: Analyzing trace with hash 660003323, now seen corresponding path program 1 times [2024-10-14 18:15:07,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:07,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516863245] [2024-10-14 18:15:07,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:07,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:07,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:08,893 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:15:08,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:08,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516863245] [2024-10-14 18:15:08,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516863245] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:08,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [761455900] [2024-10-14 18:15:08,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:08,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:08,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:08,896 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:08,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-14 18:15:09,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:09,069 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-10-14 18:15:09,071 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:09,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 18:15:09,156 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:15:09,156 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-10-14 18:15:09,192 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 11 treesize of output 7 [2024-10-14 18:15:09,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-14 18:15:09,291 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:15:09,292 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 33 treesize of output 32 [2024-10-14 18:15:09,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2024-10-14 18:15:09,515 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:09,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 24 [2024-10-14 18:15:09,607 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 16 treesize of output 8 [2024-10-14 18:15:09,639 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:15:09,639 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:09,761 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 8 treesize of output 4 [2024-10-14 18:15:09,823 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 21 treesize of output 13 [2024-10-14 18:15:09,883 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1505 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1505) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0))) is different from false [2024-10-14 18:15:10,000 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:10,001 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2024-10-14 18:15:10,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:10,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 35 treesize of output 33 [2024-10-14 18:15:10,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-10-14 18:15:10,259 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:15:10,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [761455900] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:15:10,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:15:10,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 16] total 49 [2024-10-14 18:15:10,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353944452] [2024-10-14 18:15:10,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:10,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-10-14 18:15:10,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:10,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-10-14 18:15:10,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=2108, Unknown=3, NotChecked=92, Total=2352 [2024-10-14 18:15:10,262 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 49 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 49 states have internal predecessors, (82), 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-10-14 18:15:11,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:11,553 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2024-10-14 18:15:11,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-14 18:15:11,554 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 49 states have internal predecessors, (82), 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 30 [2024-10-14 18:15:11,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:11,554 INFO L225 Difference]: With dead ends: 67 [2024-10-14 18:15:11,555 INFO L226 Difference]: Without dead ends: 65 [2024-10-14 18:15:11,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=420, Invalid=3994, Unknown=12, NotChecked=130, Total=4556 [2024-10-14 18:15:11,557 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 104 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 25 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:11,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 346 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1017 Invalid, 1 Unknown, 65 Unchecked, 0.6s Time] [2024-10-14 18:15:11,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-14 18:15:11,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 52. [2024-10-14 18:15:11,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 51 states have internal predecessors, (54), 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-10-14 18:15:11,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2024-10-14 18:15:11,559 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 30 [2024-10-14 18:15:11,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:11,559 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2024-10-14 18:15:11,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 1.6734693877551021) internal successors, (82), 49 states have internal predecessors, (82), 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-10-14 18:15:11,560 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2024-10-14 18:15:11,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 18:15:11,560 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:11,560 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:11,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-14 18:15:11,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-10-14 18:15:11,762 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-14 18:15:11,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:11,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1975835843, now seen corresponding path program 1 times [2024-10-14 18:15:11,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:11,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907615352] [2024-10-14 18:15:11,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:11,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:11,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:12,537 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:15:12,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:12,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907615352] [2024-10-14 18:15:12,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907615352] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:12,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795117393] [2024-10-14 18:15:12,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:12,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:12,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:12,541 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:12,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-14 18:15:12,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:12,728 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-10-14 18:15:12,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:12,736 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-10-14 18:15:12,759 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:15:12,759 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-10-14 18:15:12,773 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 11 treesize of output 7 [2024-10-14 18:15:12,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-14 18:15:12,819 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:15:12,820 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 25 treesize of output 26 [2024-10-14 18:15:12,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:12,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2024-10-14 18:15:12,957 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 25 treesize of output 17 [2024-10-14 18:15:13,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 9 [2024-10-14 18:15:13,101 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 8 [2024-10-14 18:15:13,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-10-14 18:15:13,121 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:15:13,122 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:13,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:13,299 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 68 treesize of output 72 [2024-10-14 18:15:13,419 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 8 treesize of output 4 [2024-10-14 18:15:13,461 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 25 treesize of output 13 [2024-10-14 18:15:13,521 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1633 (Array Int Int)) (v_ArrVal_1631 Int)) (not (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) v_ArrVal_1631)) |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1633) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) is different from false [2024-10-14 18:15:13,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:13,528 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 32 [2024-10-14 18:15:13,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:13,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 35 treesize of output 33 [2024-10-14 18:15:13,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-10-14 18:15:13,607 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-10-14 18:15:13,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795117393] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:15:13,608 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:15:13,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 35 [2024-10-14 18:15:13,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885237978] [2024-10-14 18:15:13,608 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:13,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-14 18:15:13,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:13,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-14 18:15:13,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1059, Unknown=11, NotChecked=66, Total=1260 [2024-10-14 18:15:13,610 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 36 states have internal predecessors, (67), 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-10-14 18:15:14,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:14,501 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2024-10-14 18:15:14,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-14 18:15:14,501 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 36 states have internal predecessors, (67), 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 31 [2024-10-14 18:15:14,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:14,502 INFO L225 Difference]: With dead ends: 77 [2024-10-14 18:15:14,502 INFO L226 Difference]: Without dead ends: 77 [2024-10-14 18:15:14,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 521 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=289, Invalid=2253, Unknown=12, NotChecked=98, Total=2652 [2024-10-14 18:15:14,503 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 67 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:14,503 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 324 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 883 Invalid, 0 Unknown, 58 Unchecked, 0.5s Time] [2024-10-14 18:15:14,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-14 18:15:14,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 54. [2024-10-14 18:15:14,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 53 states have internal predecessors, (57), 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-10-14 18:15:14,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2024-10-14 18:15:14,504 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 31 [2024-10-14 18:15:14,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:14,505 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2024-10-14 18:15:14,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 36 states have internal predecessors, (67), 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-10-14 18:15:14,505 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2024-10-14 18:15:14,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 18:15:14,505 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:14,505 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:14,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-14 18:15:14,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:14,706 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-14 18:15:14,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:14,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1975835844, now seen corresponding path program 1 times [2024-10-14 18:15:14,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:14,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95179970] [2024-10-14 18:15:14,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:14,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:14,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:15,529 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:15:15,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:15,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95179970] [2024-10-14 18:15:15,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95179970] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:15,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295484288] [2024-10-14 18:15:15,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:15,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:15,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:15,532 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:15,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-14 18:15:15,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:15,734 INFO L255 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-10-14 18:15:15,737 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:15,754 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-10-14 18:15:15,823 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:15:15,823 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-10-14 18:15:15,866 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 11 treesize of output 7 [2024-10-14 18:15:15,876 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 15 treesize of output 1 [2024-10-14 18:15:15,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-10-14 18:15:15,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-10-14 18:15:15,988 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 18:15:15,988 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 41 treesize of output 38 [2024-10-14 18:15:15,992 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 31 treesize of output 16 [2024-10-14 18:15:16,236 INFO L349 Elim1Store]: treesize reduction 24, result has 51.0 percent of original size [2024-10-14 18:15:16,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 34 [2024-10-14 18:15:16,260 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2024-10-14 18:15:16,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 34 treesize of output 24 [2024-10-14 18:15:16,547 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-14 18:15:16,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 8 [2024-10-14 18:15:16,647 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 23 treesize of output 15 [2024-10-14 18:15:16,650 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 26 treesize of output 14 [2024-10-14 18:15:16,654 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:15:16,654 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:17,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:17,034 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 61 [2024-10-14 18:15:17,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:17,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 122 treesize of output 121 [2024-10-14 18:15:17,366 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 14 [2024-10-14 18:15:17,617 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:17,617 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 33 [2024-10-14 18:15:17,632 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:17,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 47 [2024-10-14 18:15:17,929 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:15:17,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295484288] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 18:15:17,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 18:15:17,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 52 [2024-10-14 18:15:17,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169756297] [2024-10-14 18:15:17,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 18:15:17,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-10-14 18:15:17,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 18:15:17,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-10-14 18:15:17,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=2551, Unknown=9, NotChecked=0, Total=2756 [2024-10-14 18:15:17,933 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand has 53 states, 52 states have (on average 1.75) internal successors, (91), 53 states have internal predecessors, (91), 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-10-14 18:15:19,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 18:15:19,403 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2024-10-14 18:15:19,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-10-14 18:15:19,403 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.75) internal successors, (91), 53 states have internal predecessors, (91), 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 31 [2024-10-14 18:15:19,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 18:15:19,404 INFO L225 Difference]: With dead ends: 71 [2024-10-14 18:15:19,404 INFO L226 Difference]: Without dead ends: 71 [2024-10-14 18:15:19,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1181 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=496, Invalid=4607, Unknown=9, NotChecked=0, Total=5112 [2024-10-14 18:15:19,405 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 128 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 1123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 18:15:19,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 503 Invalid, 1123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1110 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 18:15:19,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-10-14 18:15:19,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 54. [2024-10-14 18:15:19,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 53 states have internal predecessors, (56), 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-10-14 18:15:19,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2024-10-14 18:15:19,407 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 31 [2024-10-14 18:15:19,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 18:15:19,408 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2024-10-14 18:15:19,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 1.75) internal successors, (91), 53 states have internal predecessors, (91), 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-10-14 18:15:19,408 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2024-10-14 18:15:19,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-14 18:15:19,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 18:15:19,409 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 18:15:19,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2024-10-14 18:15:19,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:19,610 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 22 more)] === [2024-10-14 18:15:19,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 18:15:19,610 INFO L85 PathProgramCache]: Analyzing trace with hash 402760065, now seen corresponding path program 1 times [2024-10-14 18:15:19,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 18:15:19,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663688045] [2024-10-14 18:15:19,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:19,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 18:15:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:21,448 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:15:21,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 18:15:21,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663688045] [2024-10-14 18:15:21,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663688045] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 18:15:21,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888774113] [2024-10-14 18:15:21,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 18:15:21,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 18:15:21,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 18:15:21,449 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 18:15:21,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-14 18:15:21,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 18:15:21,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-10-14 18:15:21,617 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 18:15:21,650 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-10-14 18:15:21,708 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 11 treesize of output 7 [2024-10-14 18:15:21,712 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 11 treesize of output 7 [2024-10-14 18:15:21,757 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 23 treesize of output 11 [2024-10-14 18:15:21,763 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 19 treesize of output 18 [2024-10-14 18:15:21,872 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 18:15:21,873 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-10-14 18:15:21,929 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 23 treesize of output 16 [2024-10-14 18:15:21,938 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 16 treesize of output 11 [2024-10-14 18:15:21,948 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 19 treesize of output 18 [2024-10-14 18:15:21,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2024-10-14 18:15:22,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2024-10-14 18:15:22,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2024-10-14 18:15:22,098 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 18:15:22,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 61 [2024-10-14 18:15:22,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2024-10-14 18:15:22,494 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:15:22,586 INFO L349 Elim1Store]: treesize reduction 206, result has 41.8 percent of original size [2024-10-14 18:15:22,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 89 treesize of output 163 [2024-10-14 18:15:22,603 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-14 18:15:22,670 INFO L349 Elim1Store]: treesize reduction 122, result has 39.6 percent of original size [2024-10-14 18:15:22,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 126 treesize of output 138 [2024-10-14 18:15:23,327 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 67 [2024-10-14 18:15:23,340 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-14 18:15:23,486 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 11 [2024-10-14 18:15:23,556 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 18:15:23,556 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 18:15:24,024 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:15:24,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 322 treesize of output 321 [2024-10-14 18:15:34,366 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 60 treesize of output 40 [2024-10-14 18:16:07,746 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:16:07,747 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 102 [2024-10-14 18:16:07,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:16:07,758 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 82 [2024-10-14 18:16:07,788 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:16:07,789 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 125 treesize of output 122 [2024-10-14 18:16:07,801 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:16:07,802 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 105 treesize of output 82 [2024-10-14 18:16:07,829 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (+ 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|)) (.cse4 (+ |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_dll_create_~head~0#1.offset| 8))) (and (forall ((v_arrayElimArr_8 (Array Int Int)) (v_arrayElimArr_9 (Array Int Int)) (v_ArrVal_1911 Int)) (or (= (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_8))) (store .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2 v_ArrVal_1911))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) (+ 4 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_9))) (store .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4))) 0) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_9 .cse4))) (not (= (select v_arrayElimArr_8 .cse4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= (select v_arrayElimArr_9 .cse5) 0)))) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_1911 Int)) (or (not (= (select v_arrayElimArr_11 .cse5) 0)) (not (= (select v_arrayElimArr_10 .cse4) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| (select v_arrayElimArr_11 .cse4))) (= (let ((.cse6 (let ((.cse8 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_11))) (store .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse8 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|))))) (select (select .cse6 (select (select (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_arrayElimArr_10))) (store .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse7 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2 v_ArrVal_1911))) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4)) (+ (select (select .cse6 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 4))) 0))))) is different from false [2024-10-14 18:16:08,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:16:08,881 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 189 treesize of output 194 [2024-10-14 18:16:08,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:16:08,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 18:16:09,001 INFO L349 Elim1Store]: treesize reduction 162, result has 43.4 percent of original size [2024-10-14 18:16:09,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 627 treesize of output 553 [2024-10-14 18:16:09,024 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 521 treesize of output 499 [2024-10-14 18:16:09,080 INFO L349 Elim1Store]: treesize reduction 15, result has 71.7 percent of original size [2024-10-14 18:16:09,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 643 treesize of output 600 [2024-10-14 18:16:09,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 505 treesize of output 483 [2024-10-14 18:16:09,162 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:16:09,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 441 treesize of output 429 [2024-10-14 18:16:09,235 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 18:16:09,235 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 262 treesize of output 260