./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lhb-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 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/loop-industry-pattern/aiob_4.c.v+lhb-reducer.c -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 de5a591efb40e891e226106d8590a7409596f3a27aca8b697af826abd4fe5201 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:40:32,204 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:40:32,260 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-24 16:40:32,270 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:40:32,288 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:40:32,324 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:40:32,324 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:40:32,325 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:40:32,326 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:40:32,326 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:40:32,326 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:40:32,326 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:40:32,327 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:40:32,327 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:40:32,327 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:40:32,328 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:40:32,328 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 16:40:32,328 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:40:32,329 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 16:40:32,329 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:40:32,329 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:40:32,330 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:40:32,330 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 16:40:32,330 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:40:32,334 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:40:32,334 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:40:32,334 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:40:32,335 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 16:40:32,335 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:40:32,335 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:40:32,335 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:40:32,335 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:40:32,336 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:40:32,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:40:32,336 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:40:32,336 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:40:32,336 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 16:40:32,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 16:40:32,336 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:40:32,337 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:40:32,337 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:40:32,341 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:40:32,341 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 -> de5a591efb40e891e226106d8590a7409596f3a27aca8b697af826abd4fe5201 [2024-10-24 16:40:32,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:40:32,576 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:40:32,578 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:40:32,579 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:40:32,583 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:40:32,584 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lhb-reducer.c [2024-10-24 16:40:34,067 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:40:34,287 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:40:34,287 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lhb-reducer.c [2024-10-24 16:40:34,302 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c60f4ca10/4cd3fa072a8e44cba2a4e9daf05567e4/FLAG5be86b136 [2024-10-24 16:40:34,317 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c60f4ca10/4cd3fa072a8e44cba2a4e9daf05567e4 [2024-10-24 16:40:34,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:40:34,321 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:40:34,323 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:40:34,323 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:40:34,330 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:40:34,331 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:40:34" (1/1) ... [2024-10-24 16:40:34,331 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d51622 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:34, skipping insertion in model container [2024-10-24 16:40:34,331 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:40:34" (1/1) ... [2024-10-24 16:40:34,369 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:40:34,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:40:34,686 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 16:40:34,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:40:34,830 INFO L204 MainTranslator]: Completed translation [2024-10-24 16:40:34,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:34 WrapperNode [2024-10-24 16:40:34,836 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:40:34,837 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 16:40:34,837 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 16:40:34,838 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 16:40:34,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:34" (1/1) ... [2024-10-24 16:40:34,873 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:34" (1/1) ... [2024-10-24 16:40:34,950 INFO L138 Inliner]: procedures = 17, calls = 293, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 793 [2024-10-24 16:40:34,951 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 16:40:34,952 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 16:40:34,952 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 16:40:34,952 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 16:40:34,978 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:34" (1/1) ... [2024-10-24 16:40:34,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:34" (1/1) ... [2024-10-24 16:40:34,990 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:34" (1/1) ... [2024-10-24 16:40:35,047 INFO L175 MemorySlicer]: Split 188 memory accesses to 5 slices as follows [2, 7, 2, 41, 136]. 72 percent of accesses are in the largest equivalence class. The 137 initializations are split as follows [2, 7, 2, 0, 126]. The 0 writes are split as follows [0, 0, 0, 0, 0]. [2024-10-24 16:40:35,047 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:34" (1/1) ... [2024-10-24 16:40:35,048 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:34" (1/1) ... [2024-10-24 16:40:35,089 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:34" (1/1) ... [2024-10-24 16:40:35,103 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:34" (1/1) ... [2024-10-24 16:40:35,106 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:34" (1/1) ... [2024-10-24 16:40:35,116 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:34" (1/1) ... [2024-10-24 16:40:35,126 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 16:40:35,131 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 16:40:35,131 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 16:40:35,132 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 16:40:35,132 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:34" (1/1) ... [2024-10-24 16:40:35,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:40:35,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:40:35,198 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-24 16:40:35,203 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-24 16:40:35,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 16:40:35,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-24 16:40:35,237 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-24 16:40:35,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-24 16:40:35,238 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-10-24 16:40:35,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 16:40:35,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 16:40:35,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-24 16:40:35,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-24 16:40:35,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-24 16:40:35,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-24 16:40:35,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-24 16:40:35,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 16:40:35,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 16:40:35,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-24 16:40:35,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-24 16:40:35,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-24 16:40:35,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-24 16:40:35,242 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-24 16:40:35,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 16:40:35,391 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 16:40:35,392 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 16:40:36,061 INFO L? ?]: Removed 328 outVars from TransFormulas that were not future-live. [2024-10-24 16:40:36,061 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 16:40:36,199 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 16:40:36,200 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-24 16:40:36,200 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:40:36 BoogieIcfgContainer [2024-10-24 16:40:36,200 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 16:40:36,201 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 16:40:36,205 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 16:40:36,207 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 16:40:36,207 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:40:34" (1/3) ... [2024-10-24 16:40:36,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708f3afd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:40:36, skipping insertion in model container [2024-10-24 16:40:36,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:40:34" (2/3) ... [2024-10-24 16:40:36,208 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708f3afd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:40:36, skipping insertion in model container [2024-10-24 16:40:36,208 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:40:36" (3/3) ... [2024-10-24 16:40:36,209 INFO L112 eAbstractionObserver]: Analyzing ICFG aiob_4.c.v+lhb-reducer.c [2024-10-24 16:40:36,248 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 16:40:36,252 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 104 error locations. [2024-10-24 16:40:36,312 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 16:40:36,320 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;@6a050adb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 16:40:36,321 INFO L334 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2024-10-24 16:40:36,327 INFO L276 IsEmpty]: Start isEmpty. Operand has 202 states, 97 states have (on average 2.5051546391752577) internal successors, (243), 201 states have internal predecessors, (243), 0 states have call successors, (0), 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-24 16:40:36,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-24 16:40:36,332 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:36,332 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-24 16:40:36,333 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-10-24 16:40:36,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:36,341 INFO L85 PathProgramCache]: Analyzing trace with hash 472420, now seen corresponding path program 1 times [2024-10-24 16:40:36,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:36,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183058169] [2024-10-24 16:40:36,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:36,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:36,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:36,654 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-24 16:40:36,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:36,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183058169] [2024-10-24 16:40:36,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183058169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:36,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:36,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:40:36,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279095336] [2024-10-24 16:40:36,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:36,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:40:36,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:36,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:40:36,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:40:36,687 INFO L87 Difference]: Start difference. First operand has 202 states, 97 states have (on average 2.5051546391752577) internal successors, (243), 201 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-24 16:40:36,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:36,926 INFO L93 Difference]: Finished difference Result 203 states and 233 transitions. [2024-10-24 16:40:36,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:40:36,929 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2024-10-24 16:40:36,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:36,935 INFO L225 Difference]: With dead ends: 203 [2024-10-24 16:40:36,935 INFO L226 Difference]: Without dead ends: 201 [2024-10-24 16:40:36,937 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:40:36,939 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 123 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:36,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 295 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:40:36,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2024-10-24 16:40:36,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2024-10-24 16:40:36,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 97 states have (on average 2.3711340206185567) internal successors, (230), 200 states have internal predecessors, (230), 0 states have call successors, (0), 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-24 16:40:36,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 230 transitions. [2024-10-24 16:40:36,975 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 230 transitions. Word has length 3 [2024-10-24 16:40:36,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:36,975 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 230 transitions. [2024-10-24 16:40:36,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-24 16:40:36,976 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 230 transitions. [2024-10-24 16:40:36,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-24 16:40:36,976 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:36,976 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-24 16:40:36,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 16:40:36,980 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-10-24 16:40:36,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:36,981 INFO L85 PathProgramCache]: Analyzing trace with hash 472077, now seen corresponding path program 1 times [2024-10-24 16:40:36,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:36,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024119626] [2024-10-24 16:40:36,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:36,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:36,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:37,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:40:37,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:37,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024119626] [2024-10-24 16:40:37,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024119626] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:37,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:37,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:40:37,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287922856] [2024-10-24 16:40:37,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:37,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:40:37,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:37,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:40:37,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:40:37,063 INFO L87 Difference]: Start difference. First operand 201 states and 230 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-24 16:40:37,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:37,413 INFO L93 Difference]: Finished difference Result 160 states and 189 transitions. [2024-10-24 16:40:37,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:40:37,414 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2024-10-24 16:40:37,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:37,415 INFO L225 Difference]: With dead ends: 160 [2024-10-24 16:40:37,415 INFO L226 Difference]: Without dead ends: 160 [2024-10-24 16:40:37,415 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-24 16:40:37,417 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 196 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:37,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 109 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:40:37,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-24 16:40:37,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2024-10-24 16:40:37,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 97 states have (on average 1.9484536082474226) internal successors, (189), 159 states have internal predecessors, (189), 0 states have call successors, (0), 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-24 16:40:37,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 189 transitions. [2024-10-24 16:40:37,423 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 189 transitions. Word has length 3 [2024-10-24 16:40:37,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:37,424 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 189 transitions. [2024-10-24 16:40:37,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-24 16:40:37,424 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 189 transitions. [2024-10-24 16:40:37,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-24 16:40:37,424 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:37,424 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-24 16:40:37,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 16:40:37,425 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-10-24 16:40:37,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:37,425 INFO L85 PathProgramCache]: Analyzing trace with hash 472078, now seen corresponding path program 1 times [2024-10-24 16:40:37,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:37,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046924874] [2024-10-24 16:40:37,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:37,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:37,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:37,583 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-24 16:40:37,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:37,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046924874] [2024-10-24 16:40:37,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046924874] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:37,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:37,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:40:37,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477880127] [2024-10-24 16:40:37,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:37,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:40:37,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:37,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:40:37,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:40:37,585 INFO L87 Difference]: Start difference. First operand 160 states and 189 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-24 16:40:37,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:37,742 INFO L93 Difference]: Finished difference Result 119 states and 148 transitions. [2024-10-24 16:40:37,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:40:37,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2024-10-24 16:40:37,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:37,743 INFO L225 Difference]: With dead ends: 119 [2024-10-24 16:40:37,743 INFO L226 Difference]: Without dead ends: 119 [2024-10-24 16:40:37,743 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:40:37,744 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 40 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:37,745 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 245 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:40:37,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-24 16:40:37,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-10-24 16:40:37,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 97 states have (on average 1.5257731958762886) internal successors, (148), 118 states have internal predecessors, (148), 0 states have call successors, (0), 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-24 16:40:37,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 148 transitions. [2024-10-24 16:40:37,749 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 148 transitions. Word has length 3 [2024-10-24 16:40:37,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:37,750 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 148 transitions. [2024-10-24 16:40:37,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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-24 16:40:37,750 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 148 transitions. [2024-10-24 16:40:37,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-10-24 16:40:37,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:37,751 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:40:37,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 16:40:37,751 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-10-24 16:40:37,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:37,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1022535160, now seen corresponding path program 1 times [2024-10-24 16:40:37,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:37,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568843517] [2024-10-24 16:40:37,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:37,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:37,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:37,974 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-24 16:40:37,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:37,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568843517] [2024-10-24 16:40:37,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568843517] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:37,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:37,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:40:37,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077370021] [2024-10-24 16:40:37,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:37,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:40:37,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:37,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:40:37,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:40:37,977 INFO L87 Difference]: Start difference. First operand 119 states and 148 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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-24 16:40:38,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:38,112 INFO L93 Difference]: Finished difference Result 121 states and 148 transitions. [2024-10-24 16:40:38,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:40:38,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2024-10-24 16:40:38,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:38,114 INFO L225 Difference]: With dead ends: 121 [2024-10-24 16:40:38,114 INFO L226 Difference]: Without dead ends: 121 [2024-10-24 16:40:38,114 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:40:38,115 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 49 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:38,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 163 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:40:38,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-24 16:40:38,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2024-10-24 16:40:38,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 97 states have (on average 1.5154639175257731) internal successors, (147), 118 states have internal predecessors, (147), 0 states have call successors, (0), 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-24 16:40:38,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 147 transitions. [2024-10-24 16:40:38,125 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 147 transitions. Word has length 46 [2024-10-24 16:40:38,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:38,125 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 147 transitions. [2024-10-24 16:40:38,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 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-24 16:40:38,125 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 147 transitions. [2024-10-24 16:40:38,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-24 16:40:38,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:38,126 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:40:38,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 16:40:38,132 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-10-24 16:40:38,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:38,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1633588135, now seen corresponding path program 1 times [2024-10-24 16:40:38,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:38,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117776180] [2024-10-24 16:40:38,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:38,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:38,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:38,445 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-24 16:40:38,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:38,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117776180] [2024-10-24 16:40:38,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117776180] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:38,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:38,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:40:38,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614713787] [2024-10-24 16:40:38,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:38,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:40:38,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:38,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:40:38,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:40:38,447 INFO L87 Difference]: Start difference. First operand 119 states and 147 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 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-24 16:40:38,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:38,559 INFO L93 Difference]: Finished difference Result 119 states and 146 transitions. [2024-10-24 16:40:38,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:40:38,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 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) Word has length 47 [2024-10-24 16:40:38,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:38,560 INFO L225 Difference]: With dead ends: 119 [2024-10-24 16:40:38,560 INFO L226 Difference]: Without dead ends: 119 [2024-10-24 16:40:38,561 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:40:38,562 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 0 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:38,562 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 205 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:40:38,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-24 16:40:38,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-10-24 16:40:38,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 97 states have (on average 1.5051546391752577) internal successors, (146), 118 states have internal predecessors, (146), 0 states have call successors, (0), 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-24 16:40:38,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 146 transitions. [2024-10-24 16:40:38,566 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 146 transitions. Word has length 47 [2024-10-24 16:40:38,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:38,567 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 146 transitions. [2024-10-24 16:40:38,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 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-24 16:40:38,567 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 146 transitions. [2024-10-24 16:40:38,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-24 16:40:38,568 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:38,568 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:40:38,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 16:40:38,568 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-10-24 16:40:38,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:38,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1633587967, now seen corresponding path program 1 times [2024-10-24 16:40:38,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:38,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311419930] [2024-10-24 16:40:38,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:38,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:38,760 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-24 16:40:38,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:38,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311419930] [2024-10-24 16:40:38,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311419930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:38,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:38,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:40:38,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921447377] [2024-10-24 16:40:38,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:38,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:40:38,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:38,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:40:38,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:40:38,762 INFO L87 Difference]: Start difference. First operand 119 states and 146 transitions. Second operand has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 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-24 16:40:38,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:38,925 INFO L93 Difference]: Finished difference Result 118 states and 145 transitions. [2024-10-24 16:40:38,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:40:38,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 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) Word has length 47 [2024-10-24 16:40:38,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:38,926 INFO L225 Difference]: With dead ends: 118 [2024-10-24 16:40:38,926 INFO L226 Difference]: Without dead ends: 118 [2024-10-24 16:40:38,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:40:38,927 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 71 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:38,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 90 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:40:38,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-24 16:40:38,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2024-10-24 16:40:38,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 97 states have (on average 1.4948453608247423) internal successors, (145), 117 states have internal predecessors, (145), 0 states have call successors, (0), 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-24 16:40:38,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 145 transitions. [2024-10-24 16:40:38,937 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 145 transitions. Word has length 47 [2024-10-24 16:40:38,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:38,937 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 145 transitions. [2024-10-24 16:40:38,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 15.666666666666666) internal successors, (47), 4 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-24 16:40:38,938 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 145 transitions. [2024-10-24 16:40:38,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-24 16:40:38,938 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:38,938 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:40:38,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 16:40:38,939 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-10-24 16:40:38,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:38,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1633587968, now seen corresponding path program 1 times [2024-10-24 16:40:38,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:38,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105997090] [2024-10-24 16:40:38,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:38,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:38,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:39,340 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-24 16:40:39,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:39,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105997090] [2024-10-24 16:40:39,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105997090] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:39,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:39,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:40:39,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833815549] [2024-10-24 16:40:39,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:39,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:40:39,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:39,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:40:39,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:40:39,344 INFO L87 Difference]: Start difference. First operand 118 states and 145 transitions. Second operand has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 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-24 16:40:39,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:39,653 INFO L93 Difference]: Finished difference Result 117 states and 144 transitions. [2024-10-24 16:40:39,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:40:39,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 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) Word has length 47 [2024-10-24 16:40:39,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:39,655 INFO L225 Difference]: With dead ends: 117 [2024-10-24 16:40:39,656 INFO L226 Difference]: Without dead ends: 117 [2024-10-24 16:40:39,656 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:40:39,657 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 112 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:39,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 103 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:40:39,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-10-24 16:40:39,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2024-10-24 16:40:39,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 97 states have (on average 1.4845360824742269) internal successors, (144), 116 states have internal predecessors, (144), 0 states have call successors, (0), 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-24 16:40:39,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 144 transitions. [2024-10-24 16:40:39,664 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 144 transitions. Word has length 47 [2024-10-24 16:40:39,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:39,668 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 144 transitions. [2024-10-24 16:40:39,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 11.75) internal successors, (47), 5 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-24 16:40:39,669 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 144 transitions. [2024-10-24 16:40:39,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-10-24 16:40:39,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:39,670 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:40:39,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-24 16:40:39,670 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-10-24 16:40:39,670 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:39,671 INFO L85 PathProgramCache]: Analyzing trace with hash -2079981948, now seen corresponding path program 1 times [2024-10-24 16:40:39,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:39,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986604384] [2024-10-24 16:40:39,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:39,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:40,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:40:40,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:40,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986604384] [2024-10-24 16:40:40,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986604384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:40,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:40,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:40:40,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732847484] [2024-10-24 16:40:40,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:40,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:40:40,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:40,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:40:40,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:40:40,114 INFO L87 Difference]: Start difference. First operand 117 states and 144 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 5 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-24 16:40:40,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:40,304 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2024-10-24 16:40:40,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:40:40,304 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 5 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) Word has length 49 [2024-10-24 16:40:40,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:40,305 INFO L225 Difference]: With dead ends: 116 [2024-10-24 16:40:40,306 INFO L226 Difference]: Without dead ends: 115 [2024-10-24 16:40:40,306 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:40:40,306 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 137 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:40,307 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 129 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:40:40,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-10-24 16:40:40,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2024-10-24 16:40:40,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 96 states have (on average 1.1979166666666667) internal successors, (115), 114 states have internal predecessors, (115), 0 states have call successors, (0), 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-24 16:40:40,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2024-10-24 16:40:40,312 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 49 [2024-10-24 16:40:40,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:40,313 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2024-10-24 16:40:40,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 5 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-24 16:40:40,313 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2024-10-24 16:40:40,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-24 16:40:40,313 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:40,314 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:40:40,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-24 16:40:40,314 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-10-24 16:40:40,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:40,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1458658685, now seen corresponding path program 1 times [2024-10-24 16:40:40,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:40,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880805957] [2024-10-24 16:40:40,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:40,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:40,456 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-24 16:40:40,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:40,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880805957] [2024-10-24 16:40:40,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880805957] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:40,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:40,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:40:40,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775293492] [2024-10-24 16:40:40,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:40,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:40:40,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:40,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:40:40,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:40:40,460 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:40:40,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:40,601 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2024-10-24 16:40:40,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:40:40,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-24 16:40:40,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:40,603 INFO L225 Difference]: With dead ends: 114 [2024-10-24 16:40:40,605 INFO L226 Difference]: Without dead ends: 114 [2024-10-24 16:40:40,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:40:40,606 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 67 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:40,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 129 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:40:40,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-10-24 16:40:40,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-10-24 16:40:40,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 96 states have (on average 1.1875) internal successors, (114), 113 states have internal predecessors, (114), 0 states have call successors, (0), 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-24 16:40:40,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2024-10-24 16:40:40,608 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 52 [2024-10-24 16:40:40,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:40,609 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2024-10-24 16:40:40,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:40:40,610 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2024-10-24 16:40:40,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-10-24 16:40:40,610 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:40,610 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:40:40,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 16:40:40,610 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-10-24 16:40:40,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:40,612 INFO L85 PathProgramCache]: Analyzing trace with hash -1458658684, now seen corresponding path program 1 times [2024-10-24 16:40:40,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:40,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188680845] [2024-10-24 16:40:40,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:40,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:40,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:40,851 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-24 16:40:40,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:40,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188680845] [2024-10-24 16:40:40,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188680845] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:40,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:40,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:40:40,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618017842] [2024-10-24 16:40:40,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:40,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:40:40,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:40,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:40:40,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:40:40,854 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:40:41,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:41,064 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2024-10-24 16:40:41,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:40:41,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 52 [2024-10-24 16:40:41,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:41,065 INFO L225 Difference]: With dead ends: 113 [2024-10-24 16:40:41,065 INFO L226 Difference]: Without dead ends: 113 [2024-10-24 16:40:41,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:40:41,066 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 104 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:41,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 96 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:40:41,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-10-24 16:40:41,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-10-24 16:40:41,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 96 states have (on average 1.1770833333333333) internal successors, (113), 112 states have internal predecessors, (113), 0 states have call successors, (0), 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-24 16:40:41,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2024-10-24 16:40:41,071 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 52 [2024-10-24 16:40:41,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:41,071 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2024-10-24 16:40:41,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:40:41,071 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2024-10-24 16:40:41,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-24 16:40:41,073 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:41,074 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:40:41,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 16:40:41,074 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-10-24 16:40:41,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:41,074 INFO L85 PathProgramCache]: Analyzing trace with hash 709308752, now seen corresponding path program 1 times [2024-10-24 16:40:41,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:41,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [907210487] [2024-10-24 16:40:41,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:41,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:41,267 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-24 16:40:41,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:41,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [907210487] [2024-10-24 16:40:41,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [907210487] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:41,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:41,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:40:41,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012678022] [2024-10-24 16:40:41,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:41,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:40:41,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:41,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:40:41,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:40:41,270 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 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-24 16:40:41,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:41,450 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2024-10-24 16:40:41,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:40:41,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 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) Word has length 57 [2024-10-24 16:40:41,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:41,451 INFO L225 Difference]: With dead ends: 112 [2024-10-24 16:40:41,451 INFO L226 Difference]: Without dead ends: 112 [2024-10-24 16:40:41,451 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:40:41,452 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 60 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:41,452 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 126 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:40:41,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-10-24 16:40:41,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-10-24 16:40:41,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 111 states have internal predecessors, (112), 0 states have call successors, (0), 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-24 16:40:41,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2024-10-24 16:40:41,455 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 57 [2024-10-24 16:40:41,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:41,455 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2024-10-24 16:40:41,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 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-24 16:40:41,455 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2024-10-24 16:40:41,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-10-24 16:40:41,456 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:41,456 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:40:41,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-24 16:40:41,457 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-10-24 16:40:41,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:41,457 INFO L85 PathProgramCache]: Analyzing trace with hash 709308753, now seen corresponding path program 1 times [2024-10-24 16:40:41,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:41,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998875071] [2024-10-24 16:40:41,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:41,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:41,890 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-24 16:40:41,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:41,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998875071] [2024-10-24 16:40:41,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998875071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:41,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:41,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 16:40:41,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764907338] [2024-10-24 16:40:41,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:41,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:40:41,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:41,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:40:41,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:40:41,893 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand has 7 states, 6 states have (on average 9.5) internal successors, (57), 7 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-24 16:40:42,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:42,184 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2024-10-24 16:40:42,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:40:42,184 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.5) internal successors, (57), 7 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) Word has length 57 [2024-10-24 16:40:42,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:42,185 INFO L225 Difference]: With dead ends: 111 [2024-10-24 16:40:42,186 INFO L226 Difference]: Without dead ends: 111 [2024-10-24 16:40:42,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:40:42,187 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 155 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:42,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 133 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:40:42,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-24 16:40:42,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-10-24 16:40:42,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 96 states have (on average 1.15625) internal successors, (111), 110 states have internal predecessors, (111), 0 states have call successors, (0), 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-24 16:40:42,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2024-10-24 16:40:42,190 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 57 [2024-10-24 16:40:42,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:42,190 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2024-10-24 16:40:42,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.5) internal successors, (57), 7 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-24 16:40:42,191 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2024-10-24 16:40:42,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-24 16:40:42,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:42,192 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:40:42,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-24 16:40:42,192 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-10-24 16:40:42,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:42,193 INFO L85 PathProgramCache]: Analyzing trace with hash 1526752884, now seen corresponding path program 1 times [2024-10-24 16:40:42,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:42,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801946071] [2024-10-24 16:40:42,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:42,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:42,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:42,367 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-24 16:40:42,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:42,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801946071] [2024-10-24 16:40:42,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801946071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:42,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:42,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:40:42,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274699596] [2024-10-24 16:40:42,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:42,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:40:42,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:42,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:40:42,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:40:42,370 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:40:42,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:42,546 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2024-10-24 16:40:42,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:40:42,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-10-24 16:40:42,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:42,547 INFO L225 Difference]: With dead ends: 110 [2024-10-24 16:40:42,547 INFO L226 Difference]: Without dead ends: 110 [2024-10-24 16:40:42,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:40:42,548 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 53 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:42,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 123 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:40:42,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-24 16:40:42,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-10-24 16:40:42,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.1458333333333333) internal successors, (110), 109 states have internal predecessors, (110), 0 states have call successors, (0), 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-24 16:40:42,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2024-10-24 16:40:42,551 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 62 [2024-10-24 16:40:42,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:42,551 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2024-10-24 16:40:42,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 15.5) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:40:42,551 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2024-10-24 16:40:42,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-10-24 16:40:42,552 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:42,552 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:40:42,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 16:40:42,552 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-10-24 16:40:42,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:42,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1526752885, now seen corresponding path program 1 times [2024-10-24 16:40:42,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:42,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601038885] [2024-10-24 16:40:42,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:42,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:42,937 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-24 16:40:42,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:42,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601038885] [2024-10-24 16:40:42,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601038885] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:42,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:42,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:40:42,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302394200] [2024-10-24 16:40:42,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:42,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:40:42,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:42,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:40:42,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:40:42,939 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:40:43,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:43,143 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2024-10-24 16:40:43,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:40:43,144 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-10-24 16:40:43,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:43,144 INFO L225 Difference]: With dead ends: 109 [2024-10-24 16:40:43,144 INFO L226 Difference]: Without dead ends: 109 [2024-10-24 16:40:43,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:40:43,145 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 86 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:43,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 130 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:40:43,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-24 16:40:43,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-24 16:40:43,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.1354166666666667) internal successors, (109), 108 states have internal predecessors, (109), 0 states have call successors, (0), 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-24 16:40:43,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2024-10-24 16:40:43,146 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 62 [2024-10-24 16:40:43,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:43,146 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2024-10-24 16:40:43,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:40:43,147 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2024-10-24 16:40:43,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-24 16:40:43,147 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:43,147 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:40:43,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 16:40:43,147 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-10-24 16:40:43,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:43,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1697010593, now seen corresponding path program 1 times [2024-10-24 16:40:43,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:43,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33906970] [2024-10-24 16:40:43,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:43,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:43,257 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-24 16:40:43,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:43,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33906970] [2024-10-24 16:40:43,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33906970] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:43,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:43,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:40:43,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540219505] [2024-10-24 16:40:43,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:43,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:40:43,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:43,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:40:43,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:40:43,259 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 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-24 16:40:43,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:43,388 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2024-10-24 16:40:43,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:40:43,389 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 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 67 [2024-10-24 16:40:43,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:43,389 INFO L225 Difference]: With dead ends: 108 [2024-10-24 16:40:43,389 INFO L226 Difference]: Without dead ends: 108 [2024-10-24 16:40:43,389 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:40:43,390 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 46 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:43,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 120 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:40:43,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-24 16:40:43,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-10-24 16:40:43,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 96 states have (on average 1.125) internal successors, (108), 107 states have internal predecessors, (108), 0 states have call successors, (0), 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-24 16:40:43,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2024-10-24 16:40:43,392 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 67 [2024-10-24 16:40:43,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:43,392 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2024-10-24 16:40:43,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 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-24 16:40:43,392 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2024-10-24 16:40:43,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-24 16:40:43,393 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:43,393 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:40:43,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 16:40:43,393 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-10-24 16:40:43,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:43,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1697010594, now seen corresponding path program 1 times [2024-10-24 16:40:43,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:43,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930515618] [2024-10-24 16:40:43,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:43,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:43,685 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-24 16:40:43,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:43,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930515618] [2024-10-24 16:40:43,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930515618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:43,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:43,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:40:43,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331450488] [2024-10-24 16:40:43,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:43,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:40:43,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:43,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:40:43,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:40:43,688 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 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-24 16:40:43,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:43,895 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2024-10-24 16:40:43,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:40:43,896 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 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 67 [2024-10-24 16:40:43,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:43,896 INFO L225 Difference]: With dead ends: 107 [2024-10-24 16:40:43,896 INFO L226 Difference]: Without dead ends: 107 [2024-10-24 16:40:43,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:40:43,897 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 77 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:43,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 127 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:40:43,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-24 16:40:43,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-10-24 16:40:43,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 96 states have (on average 1.1145833333333333) internal successors, (107), 106 states have internal predecessors, (107), 0 states have call successors, (0), 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-24 16:40:43,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2024-10-24 16:40:43,899 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 67 [2024-10-24 16:40:43,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:43,899 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2024-10-24 16:40:43,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 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-24 16:40:43,901 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2024-10-24 16:40:43,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-24 16:40:43,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:43,902 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:40:43,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-24 16:40:43,902 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-10-24 16:40:43,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:43,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1536285083, now seen corresponding path program 1 times [2024-10-24 16:40:43,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:43,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808568453] [2024-10-24 16:40:43,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:43,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:43,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:44,047 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-24 16:40:44,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:44,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808568453] [2024-10-24 16:40:44,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808568453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:44,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:44,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:40:44,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931863607] [2024-10-24 16:40:44,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:44,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:40:44,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:44,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:40:44,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:40:44,049 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:40:44,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:44,179 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2024-10-24 16:40:44,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:40:44,179 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-10-24 16:40:44,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:44,180 INFO L225 Difference]: With dead ends: 106 [2024-10-24 16:40:44,180 INFO L226 Difference]: Without dead ends: 106 [2024-10-24 16:40:44,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:40:44,180 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 39 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:44,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 117 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:40:44,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-24 16:40:44,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-24 16:40:44,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 96 states have (on average 1.1041666666666667) internal successors, (106), 105 states have internal predecessors, (106), 0 states have call successors, (0), 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-24 16:40:44,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2024-10-24 16:40:44,182 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 72 [2024-10-24 16:40:44,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:44,182 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2024-10-24 16:40:44,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:40:44,182 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2024-10-24 16:40:44,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-24 16:40:44,182 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:44,182 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:40:44,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-24 16:40:44,183 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-10-24 16:40:44,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:44,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1536285082, now seen corresponding path program 1 times [2024-10-24 16:40:44,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:44,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932772324] [2024-10-24 16:40:44,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:44,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:44,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:44,475 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-24 16:40:44,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:44,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932772324] [2024-10-24 16:40:44,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932772324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:44,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:44,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:40:44,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130480131] [2024-10-24 16:40:44,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:44,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:40:44,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:44,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:40:44,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:40:44,478 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:40:44,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:44,731 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2024-10-24 16:40:44,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:40:44,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-10-24 16:40:44,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:44,733 INFO L225 Difference]: With dead ends: 105 [2024-10-24 16:40:44,733 INFO L226 Difference]: Without dead ends: 105 [2024-10-24 16:40:44,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:40:44,734 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 68 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:44,734 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 125 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:40:44,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-24 16:40:44,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-24 16:40:44,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 96 states have (on average 1.09375) internal successors, (105), 104 states have internal predecessors, (105), 0 states have call successors, (0), 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-24 16:40:44,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2024-10-24 16:40:44,737 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 72 [2024-10-24 16:40:44,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:44,737 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2024-10-24 16:40:44,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 14.4) internal successors, (72), 6 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-24 16:40:44,738 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2024-10-24 16:40:44,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 16:40:44,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:44,738 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:40:44,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-24 16:40:44,739 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-10-24 16:40:44,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:44,739 INFO L85 PathProgramCache]: Analyzing trace with hash -2102986254, now seen corresponding path program 1 times [2024-10-24 16:40:44,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:44,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080253288] [2024-10-24 16:40:44,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:44,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:44,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:40:44,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:44,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080253288] [2024-10-24 16:40:44,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080253288] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:44,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:44,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:40:44,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264368250] [2024-10-24 16:40:44,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:44,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:40:44,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:44,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:40:44,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:40:44,928 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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-24 16:40:45,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:45,068 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2024-10-24 16:40:45,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:40:45,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-24 16:40:45,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:45,070 INFO L225 Difference]: With dead ends: 104 [2024-10-24 16:40:45,070 INFO L226 Difference]: Without dead ends: 104 [2024-10-24 16:40:45,070 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:40:45,071 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 32 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:45,071 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 114 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:40:45,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-24 16:40:45,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-24 16:40:45,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 96 states have (on average 1.0833333333333333) internal successors, (104), 103 states have internal predecessors, (104), 0 states have call successors, (0), 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-24 16:40:45,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2024-10-24 16:40:45,073 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 77 [2024-10-24 16:40:45,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:45,073 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2024-10-24 16:40:45,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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-24 16:40:45,074 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2024-10-24 16:40:45,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-24 16:40:45,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:45,074 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:40:45,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-24 16:40:45,075 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-10-24 16:40:45,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:45,075 INFO L85 PathProgramCache]: Analyzing trace with hash -2102986253, now seen corresponding path program 1 times [2024-10-24 16:40:45,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:45,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404049987] [2024-10-24 16:40:45,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:45,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:45,446 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-24 16:40:45,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:45,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404049987] [2024-10-24 16:40:45,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404049987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:45,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:45,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:40:45,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688823239] [2024-10-24 16:40:45,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:45,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:40:45,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:45,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:40:45,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:40:45,447 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 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-24 16:40:45,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:45,663 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2024-10-24 16:40:45,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:40:45,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-10-24 16:40:45,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:45,663 INFO L225 Difference]: With dead ends: 103 [2024-10-24 16:40:45,664 INFO L226 Difference]: Without dead ends: 103 [2024-10-24 16:40:45,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:40:45,664 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 59 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:45,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 122 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:40:45,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-24 16:40:45,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-24 16:40:45,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 96 states have (on average 1.0729166666666667) internal successors, (103), 102 states have internal predecessors, (103), 0 states have call successors, (0), 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-24 16:40:45,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2024-10-24 16:40:45,666 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 77 [2024-10-24 16:40:45,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:45,666 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2024-10-24 16:40:45,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 15.4) internal successors, (77), 6 states have internal predecessors, (77), 0 states have call successors, (0), 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-24 16:40:45,666 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2024-10-24 16:40:45,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-24 16:40:45,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:45,668 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:40:45,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-24 16:40:45,668 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-10-24 16:40:45,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:45,668 INFO L85 PathProgramCache]: Analyzing trace with hash -947068329, now seen corresponding path program 1 times [2024-10-24 16:40:45,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:45,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525169180] [2024-10-24 16:40:45,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:45,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:45,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:45,978 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-24 16:40:45,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:45,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525169180] [2024-10-24 16:40:45,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525169180] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:45,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:45,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 16:40:45,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171991719] [2024-10-24 16:40:45,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:45,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:40:45,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:45,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:40:45,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:40:45,981 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand has 7 states, 6 states have (on average 13.666666666666666) internal successors, (82), 7 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-24 16:40:46,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:46,187 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2024-10-24 16:40:46,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:40:46,188 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.666666666666666) internal successors, (82), 7 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 82 [2024-10-24 16:40:46,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:46,188 INFO L225 Difference]: With dead ends: 102 [2024-10-24 16:40:46,188 INFO L226 Difference]: Without dead ends: 102 [2024-10-24 16:40:46,189 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:40:46,189 INFO L432 NwaCegarLoop]: 36 mSDtfsCounter, 80 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:46,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 119 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:40:46,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-24 16:40:46,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-10-24 16:40:46,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 96 states have (on average 1.0625) internal successors, (102), 101 states have internal predecessors, (102), 0 states have call successors, (0), 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-24 16:40:46,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2024-10-24 16:40:46,191 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 82 [2024-10-24 16:40:46,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:46,191 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2024-10-24 16:40:46,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.666666666666666) internal successors, (82), 7 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-24 16:40:46,191 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2024-10-24 16:40:46,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2024-10-24 16:40:46,192 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:46,192 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:40:46,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-24 16:40:46,192 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-10-24 16:40:46,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:46,192 INFO L85 PathProgramCache]: Analyzing trace with hash -947068330, now seen corresponding path program 1 times [2024-10-24 16:40:46,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:46,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865707591] [2024-10-24 16:40:46,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:46,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:46,309 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-24 16:40:46,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:46,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865707591] [2024-10-24 16:40:46,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865707591] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:46,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:46,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:40:46,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424899877] [2024-10-24 16:40:46,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:46,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:40:46,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:46,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:40:46,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:40:46,311 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 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-24 16:40:46,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:46,432 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2024-10-24 16:40:46,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:40:46,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 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 82 [2024-10-24 16:40:46,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:46,432 INFO L225 Difference]: With dead ends: 101 [2024-10-24 16:40:46,432 INFO L226 Difference]: Without dead ends: 101 [2024-10-24 16:40:46,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:40:46,433 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 24 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:46,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 111 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:40:46,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-24 16:40:46,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-24 16:40:46,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 96 states have (on average 1.0520833333333333) internal successors, (101), 100 states have internal predecessors, (101), 0 states have call successors, (0), 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-24 16:40:46,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2024-10-24 16:40:46,435 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 82 [2024-10-24 16:40:46,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:46,435 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2024-10-24 16:40:46,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 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-24 16:40:46,435 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2024-10-24 16:40:46,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-24 16:40:46,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:46,436 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:40:46,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-24 16:40:46,436 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-10-24 16:40:46,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:46,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1504977987, now seen corresponding path program 1 times [2024-10-24 16:40:46,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:46,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223957047] [2024-10-24 16:40:46,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:46,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:46,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:40:46,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:46,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223957047] [2024-10-24 16:40:46,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223957047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:46,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:46,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:40:46,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140085016] [2024-10-24 16:40:46,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:46,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:40:46,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:46,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:40:46,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:40:46,561 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 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-24 16:40:46,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:46,699 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2024-10-24 16:40:46,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:40:46,699 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-10-24 16:40:46,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:46,700 INFO L225 Difference]: With dead ends: 100 [2024-10-24 16:40:46,700 INFO L226 Difference]: Without dead ends: 100 [2024-10-24 16:40:46,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:40:46,701 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 19 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:46,701 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 105 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:40:46,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-24 16:40:46,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-24 16:40:46,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 99 states have internal predecessors, (100), 0 states have call successors, (0), 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-24 16:40:46,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2024-10-24 16:40:46,704 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 87 [2024-10-24 16:40:46,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:46,704 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2024-10-24 16:40:46,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 0 states have call successors, (0), 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-24 16:40:46,704 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2024-10-24 16:40:46,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-10-24 16:40:46,705 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:46,705 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:40:46,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-24 16:40:46,705 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr99REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-10-24 16:40:46,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:46,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1504977988, now seen corresponding path program 1 times [2024-10-24 16:40:46,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:46,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871943112] [2024-10-24 16:40:46,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:46,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:46,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:47,233 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-24 16:40:47,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:47,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871943112] [2024-10-24 16:40:47,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871943112] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:47,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:47,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:40:47,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286967778] [2024-10-24 16:40:47,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:47,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:40:47,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:47,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:40:47,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:40:47,236 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand has 6 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 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-24 16:40:47,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:47,515 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2024-10-24 16:40:47,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:40:47,516 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2024-10-24 16:40:47,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:47,516 INFO L225 Difference]: With dead ends: 99 [2024-10-24 16:40:47,517 INFO L226 Difference]: Without dead ends: 99 [2024-10-24 16:40:47,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:40:47,517 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 42 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:47,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 113 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:40:47,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-24 16:40:47,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-24 16:40:47,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 96 states have (on average 1.03125) internal successors, (99), 98 states have internal predecessors, (99), 0 states have call successors, (0), 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-24 16:40:47,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2024-10-24 16:40:47,521 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 87 [2024-10-24 16:40:47,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:47,521 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2024-10-24 16:40:47,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 17.4) internal successors, (87), 6 states have internal predecessors, (87), 0 states have call successors, (0), 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-24 16:40:47,521 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2024-10-24 16:40:47,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 16:40:47,522 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:47,522 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:40:47,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-24 16:40:47,522 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-10-24 16:40:47,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:47,523 INFO L85 PathProgramCache]: Analyzing trace with hash -2116857161, now seen corresponding path program 1 times [2024-10-24 16:40:47,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:47,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68749234] [2024-10-24 16:40:47,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:47,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:48,370 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-24 16:40:48,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:48,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68749234] [2024-10-24 16:40:48,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68749234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:48,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:48,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-24 16:40:48,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631650957] [2024-10-24 16:40:48,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:48,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-24 16:40:48,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:48,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-24 16:40:48,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2024-10-24 16:40:48,375 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand has 17 states, 17 states have (on average 5.470588235294118) internal successors, (93), 17 states have internal predecessors, (93), 0 states have call successors, (0), 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-24 16:40:48,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:48,996 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2024-10-24 16:40:48,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-24 16:40:48,996 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.470588235294118) internal successors, (93), 17 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2024-10-24 16:40:48,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:48,997 INFO L225 Difference]: With dead ends: 108 [2024-10-24 16:40:48,998 INFO L226 Difference]: Without dead ends: 108 [2024-10-24 16:40:48,998 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2024-10-24 16:40:48,998 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 85 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 919 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:48,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 323 Invalid, 925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 919 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 16:40:48,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-24 16:40:49,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 102. [2024-10-24 16:40:49,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 99 states have (on average 1.0303030303030303) internal successors, (102), 101 states have internal predecessors, (102), 0 states have call successors, (0), 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-24 16:40:49,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2024-10-24 16:40:49,000 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 93 [2024-10-24 16:40:49,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:49,001 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2024-10-24 16:40:49,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.470588235294118) internal successors, (93), 17 states have internal predecessors, (93), 0 states have call successors, (0), 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-24 16:40:49,001 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2024-10-24 16:40:49,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 16:40:49,004 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:49,004 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:40:49,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-24 16:40:49,008 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-10-24 16:40:49,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:49,009 INFO L85 PathProgramCache]: Analyzing trace with hash -2116871991, now seen corresponding path program 1 times [2024-10-24 16:40:49,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:49,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406108235] [2024-10-24 16:40:49,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:49,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:49,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:49,308 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-24 16:40:49,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:49,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406108235] [2024-10-24 16:40:49,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406108235] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:49,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:49,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 16:40:49,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371120595] [2024-10-24 16:40:49,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:49,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-24 16:40:49,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:49,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-24 16:40:49,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-24 16:40:49,313 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 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-24 16:40:49,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:49,435 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2024-10-24 16:40:49,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 16:40:49,435 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2024-10-24 16:40:49,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:49,436 INFO L225 Difference]: With dead ends: 101 [2024-10-24 16:40:49,436 INFO L226 Difference]: Without dead ends: 101 [2024-10-24 16:40:49,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:40:49,437 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 11 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:49,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 102 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:40:49,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-10-24 16:40:49,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-10-24 16:40:49,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 99 states have (on average 1.02020202020202) internal successors, (101), 100 states have internal predecessors, (101), 0 states have call successors, (0), 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-24 16:40:49,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2024-10-24 16:40:49,438 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 93 [2024-10-24 16:40:49,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:49,438 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2024-10-24 16:40:49,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 0 states have call successors, (0), 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-24 16:40:49,438 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2024-10-24 16:40:49,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-10-24 16:40:49,439 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:49,439 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:40:49,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-24 16:40:49,439 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-10-24 16:40:49,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:49,440 INFO L85 PathProgramCache]: Analyzing trace with hash -2116871990, now seen corresponding path program 1 times [2024-10-24 16:40:49,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:49,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177200118] [2024-10-24 16:40:49,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:49,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:49,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:49,827 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-24 16:40:49,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:49,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177200118] [2024-10-24 16:40:49,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177200118] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:40:49,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:40:49,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:40:49,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363145878] [2024-10-24 16:40:49,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:40:49,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:40:49,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:49,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:40:49,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:40:49,829 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand has 6 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 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-24 16:40:50,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:50,109 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2024-10-24 16:40:50,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-24 16:40:50,110 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2024-10-24 16:40:50,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:50,111 INFO L225 Difference]: With dead ends: 100 [2024-10-24 16:40:50,111 INFO L226 Difference]: Without dead ends: 100 [2024-10-24 16:40:50,111 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:40:50,112 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 32 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:50,112 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 110 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:40:50,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-24 16:40:50,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-24 16:40:50,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.0101010101010102) internal successors, (100), 99 states have internal predecessors, (100), 0 states have call successors, (0), 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-24 16:40:50,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2024-10-24 16:40:50,114 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 93 [2024-10-24 16:40:50,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:50,115 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2024-10-24 16:40:50,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 18.6) internal successors, (93), 6 states have internal predecessors, (93), 0 states have call successors, (0), 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-24 16:40:50,115 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2024-10-24 16:40:50,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-24 16:40:50,116 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:50,116 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:40:50,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-24 16:40:50,116 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-10-24 16:40:50,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:50,117 INFO L85 PathProgramCache]: Analyzing trace with hash -589668726, now seen corresponding path program 1 times [2024-10-24 16:40:50,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:50,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074666160] [2024-10-24 16:40:50,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:50,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:50,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:40:50,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:50,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074666160] [2024-10-24 16:40:50,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074666160] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:40:50,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1458542443] [2024-10-24 16:40:50,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:50,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:40:50,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:40:50,751 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-24 16:40:50,753 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-24 16:40:51,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:51,115 INFO L255 TraceCheckSpWp]: Trace formula consists of 1096 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-24 16:40:51,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:40:51,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:40:51,218 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:40:51,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:40:51,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1458542443] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:40:51,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:40:51,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14, 14] total 31 [2024-10-24 16:40:51,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806475813] [2024-10-24 16:40:51,568 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:40:51,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-24 16:40:51,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:51,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-24 16:40:51,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=691, Unknown=0, NotChecked=0, Total=930 [2024-10-24 16:40:51,569 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand has 31 states, 31 states have (on average 5.580645161290323) internal successors, (173), 31 states have internal predecessors, (173), 0 states have call successors, (0), 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-24 16:40:56,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:40:56,042 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2024-10-24 16:40:56,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-10-24 16:40:56,043 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 5.580645161290323) internal successors, (173), 31 states have internal predecessors, (173), 0 states have call successors, (0), 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 99 [2024-10-24 16:40:56,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:40:56,043 INFO L225 Difference]: With dead ends: 175 [2024-10-24 16:40:56,044 INFO L226 Difference]: Without dead ends: 175 [2024-10-24 16:40:56,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=683, Invalid=1867, Unknown=0, NotChecked=0, Total=2550 [2024-10-24 16:40:56,045 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 432 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 1191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 16:40:56,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 403 Invalid, 1191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-24 16:40:56,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2024-10-24 16:40:56,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2024-10-24 16:40:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.0058479532163742) internal successors, (172), 171 states have internal predecessors, (172), 0 states have call successors, (0), 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-24 16:40:56,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2024-10-24 16:40:56,049 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 99 [2024-10-24 16:40:56,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:40:56,049 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2024-10-24 16:40:56,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 5.580645161290323) internal successors, (173), 31 states have internal predecessors, (173), 0 states have call successors, (0), 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-24 16:40:56,050 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2024-10-24 16:40:56,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-10-24 16:40:56,051 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:40:56,051 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:40:56,073 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-24 16:40:56,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-24 16:40:56,256 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-10-24 16:40:56,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:40:56,256 INFO L85 PathProgramCache]: Analyzing trace with hash 338242798, now seen corresponding path program 2 times [2024-10-24 16:40:56,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:40:56,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480850706] [2024-10-24 16:40:56,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:40:56,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:40:56,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:40:57,590 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 507 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:40:57,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:40:57,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480850706] [2024-10-24 16:40:57,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480850706] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:40:57,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816079049] [2024-10-24 16:40:57,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:40:57,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:40:57,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:40:57,593 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-24 16:40:57,596 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-24 16:40:58,068 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 16:40:58,068 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:40:58,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 1600 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-10-24 16:40:58,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:40:58,261 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 507 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:40:58,261 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:40:59,373 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 0 proven. 507 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:40:59,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816079049] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:40:59,375 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:40:59,375 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 26, 26] total 55 [2024-10-24 16:40:59,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756826316] [2024-10-24 16:40:59,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:40:59,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2024-10-24 16:40:59,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:40:59,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2024-10-24 16:40:59,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=737, Invalid=2233, Unknown=0, NotChecked=0, Total=2970 [2024-10-24 16:40:59,383 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand has 55 states, 55 states have (on average 5.763636363636364) internal successors, (317), 55 states have internal predecessors, (317), 0 states have call successors, (0), 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-24 16:41:39,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:41:39,359 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2024-10-24 16:41:39,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-10-24 16:41:39,360 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 5.763636363636364) internal successors, (317), 55 states have internal predecessors, (317), 0 states have call successors, (0), 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 171 [2024-10-24 16:41:39,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:41:39,365 INFO L225 Difference]: With dead ends: 295 [2024-10-24 16:41:39,365 INFO L226 Difference]: Without dead ends: 295 [2024-10-24 16:41:39,367 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1011 ImplicationChecksByTransitivity, 39.8s TimeCoverageRelationStatistics Valid=2208, Invalid=6722, Unknown=0, NotChecked=0, Total=8930 [2024-10-24 16:41:39,367 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 382 mSDsluCounter, 1277 mSDsCounter, 0 mSdLazyCounter, 3266 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1327 SdHoareTripleChecker+Invalid, 3307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 3266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:41:39,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1327 Invalid, 3307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 3266 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 16:41:39,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2024-10-24 16:41:39,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 292. [2024-10-24 16:41:39,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 291 states have (on average 1.0034364261168385) internal successors, (292), 291 states have internal predecessors, (292), 0 states have call successors, (0), 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-24 16:41:39,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 292 transitions. [2024-10-24 16:41:39,378 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 292 transitions. Word has length 171 [2024-10-24 16:41:39,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:41:39,382 INFO L471 AbstractCegarLoop]: Abstraction has 292 states and 292 transitions. [2024-10-24 16:41:39,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 5.763636363636364) internal successors, (317), 55 states have internal predecessors, (317), 0 states have call successors, (0), 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-24 16:41:39,382 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 292 transitions. [2024-10-24 16:41:39,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2024-10-24 16:41:39,384 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:41:39,384 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:41:39,412 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-24 16:41:39,585 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,SelfDestructingSolverStorable28 [2024-10-24 16:41:39,585 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr102ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2024-10-24 16:41:39,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:41:39,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1905767658, now seen corresponding path program 3 times [2024-10-24 16:41:39,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:41:39,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084016034] [2024-10-24 16:41:39,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:41:39,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:41:40,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:41:44,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3267 backedges. 99 proven. 3168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:41:44,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:41:44,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084016034] [2024-10-24 16:41:44,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084016034] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:41:44,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [219662148] [2024-10-24 16:41:44,399 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-24 16:41:44,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:41:44,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:41:44,400 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-24 16:41:44,401 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-24 16:41:45,202 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-10-24 16:41:45,203 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:41:45,208 INFO L255 TraceCheckSpWp]: Trace formula consists of 1138 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-24 16:41:45,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:41:46,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:41:46,122 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 19 treesize of output 17 [2024-10-24 16:41:46,398 INFO L134 CoverageAnalysis]: Checked inductivity of 3267 backedges. 96 proven. 163 refuted. 0 times theorem prover too weak. 3008 trivial. 0 not checked. [2024-10-24 16:41:46,399 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:41:51,228 INFO L134 CoverageAnalysis]: Checked inductivity of 3267 backedges. 0 proven. 259 refuted. 0 times theorem prover too weak. 3008 trivial. 0 not checked. [2024-10-24 16:41:51,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [219662148] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:41:51,228 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:41:51,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 10, 10] total 68 [2024-10-24 16:41:51,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811992155] [2024-10-24 16:41:51,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:41:51,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2024-10-24 16:41:51,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:41:51,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2024-10-24 16:41:51,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=589, Invalid=3967, Unknown=0, NotChecked=0, Total=4556 [2024-10-24 16:41:51,231 INFO L87 Difference]: Start difference. First operand 292 states and 292 transitions. Second operand has 68 states, 68 states have (on average 6.073529411764706) internal successors, (413), 68 states have internal predecessors, (413), 0 states have call successors, (0), 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-24 16:41:59,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:41:59,292 INFO L93 Difference]: Finished difference Result 286 states and 285 transitions. [2024-10-24 16:41:59,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2024-10-24 16:41:59,292 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 6.073529411764706) internal successors, (413), 68 states have internal predecessors, (413), 0 states have call successors, (0), 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 291 [2024-10-24 16:41:59,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:41:59,293 INFO L225 Difference]: With dead ends: 286 [2024-10-24 16:41:59,293 INFO L226 Difference]: Without dead ends: 0 [2024-10-24 16:41:59,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 741 GetRequests, 566 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6212 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=2514, Invalid=28638, Unknown=0, NotChecked=0, Total=31152 [2024-10-24 16:41:59,299 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 389 mSDsluCounter, 2015 mSDsCounter, 0 mSdLazyCounter, 10417 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 2058 SdHoareTripleChecker+Invalid, 10467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 10417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-10-24 16:41:59,299 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 2058 Invalid, 10467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 10417 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-10-24 16:41:59,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-24 16:41:59,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-24 16:41:59,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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-24 16:41:59,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-24 16:41:59,300 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 291 [2024-10-24 16:41:59,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:41:59,300 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-24 16:41:59,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 6.073529411764706) internal successors, (413), 68 states have internal predecessors, (413), 0 states have call successors, (0), 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-24 16:41:59,300 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-24 16:41:59,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-24 16:41:59,302 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 104 remaining) [2024-10-24 16:41:59,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 104 remaining) [2024-10-24 16:41:59,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 104 remaining) [2024-10-24 16:41:59,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 104 remaining) [2024-10-24 16:41:59,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 104 remaining) [2024-10-24 16:41:59,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 104 remaining) [2024-10-24 16:41:59,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 104 remaining) [2024-10-24 16:41:59,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 104 remaining) [2024-10-24 16:41:59,303 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 104 remaining) [2024-10-24 16:41:59,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 104 remaining) [2024-10-24 16:41:59,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 104 remaining) [2024-10-24 16:41:59,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 104 remaining) [2024-10-24 16:41:59,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 104 remaining) [2024-10-24 16:41:59,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 104 remaining) [2024-10-24 16:41:59,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 104 remaining) [2024-10-24 16:41:59,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 104 remaining) [2024-10-24 16:41:59,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 104 remaining) [2024-10-24 16:41:59,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 104 remaining) [2024-10-24 16:41:59,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 104 remaining) [2024-10-24 16:41:59,304 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 104 remaining) [2024-10-24 16:41:59,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 104 remaining) [2024-10-24 16:41:59,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 104 remaining) [2024-10-24 16:41:59,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 104 remaining) [2024-10-24 16:41:59,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 104 remaining) [2024-10-24 16:41:59,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 104 remaining) [2024-10-24 16:41:59,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 104 remaining) [2024-10-24 16:41:59,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 104 remaining) [2024-10-24 16:41:59,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 104 remaining) [2024-10-24 16:41:59,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 104 remaining) [2024-10-24 16:41:59,305 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 104 remaining) [2024-10-24 16:41:59,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 104 remaining) [2024-10-24 16:41:59,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 104 remaining) [2024-10-24 16:41:59,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 104 remaining) [2024-10-24 16:41:59,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 104 remaining) [2024-10-24 16:41:59,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 104 remaining) [2024-10-24 16:41:59,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 104 remaining) [2024-10-24 16:41:59,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 104 remaining) [2024-10-24 16:41:59,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 104 remaining) [2024-10-24 16:41:59,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 104 remaining) [2024-10-24 16:41:59,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 104 remaining) [2024-10-24 16:41:59,306 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 104 remaining) [2024-10-24 16:41:59,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 104 remaining) [2024-10-24 16:41:59,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 104 remaining) [2024-10-24 16:41:59,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 104 remaining) [2024-10-24 16:41:59,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 104 remaining) [2024-10-24 16:41:59,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 104 remaining) [2024-10-24 16:41:59,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 104 remaining) [2024-10-24 16:41:59,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 104 remaining) [2024-10-24 16:41:59,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 104 remaining) [2024-10-24 16:41:59,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 104 remaining) [2024-10-24 16:41:59,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 104 remaining) [2024-10-24 16:41:59,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 104 remaining) [2024-10-24 16:41:59,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 104 remaining) [2024-10-24 16:41:59,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 104 remaining) [2024-10-24 16:41:59,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 104 remaining) [2024-10-24 16:41:59,307 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 104 remaining) [2024-10-24 16:41:59,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 104 remaining) [2024-10-24 16:41:59,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 104 remaining) [2024-10-24 16:41:59,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 104 remaining) [2024-10-24 16:41:59,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 104 remaining) [2024-10-24 16:41:59,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 104 remaining) [2024-10-24 16:41:59,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 104 remaining) [2024-10-24 16:41:59,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 104 remaining) [2024-10-24 16:41:59,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 104 remaining) [2024-10-24 16:41:59,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 104 remaining) [2024-10-24 16:41:59,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 104 remaining) [2024-10-24 16:41:59,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 104 remaining) [2024-10-24 16:41:59,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 104 remaining) [2024-10-24 16:41:59,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 104 remaining) [2024-10-24 16:41:59,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 104 remaining) [2024-10-24 16:41:59,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 104 remaining) [2024-10-24 16:41:59,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 104 remaining) [2024-10-24 16:41:59,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 104 remaining) [2024-10-24 16:41:59,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 104 remaining) [2024-10-24 16:41:59,308 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 104 remaining) [2024-10-24 16:41:59,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 104 remaining) [2024-10-24 16:41:59,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 104 remaining) [2024-10-24 16:41:59,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 104 remaining) [2024-10-24 16:41:59,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 104 remaining) [2024-10-24 16:41:59,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 104 remaining) [2024-10-24 16:41:59,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 104 remaining) [2024-10-24 16:41:59,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 104 remaining) [2024-10-24 16:41:59,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 104 remaining) [2024-10-24 16:41:59,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 104 remaining) [2024-10-24 16:41:59,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 104 remaining) [2024-10-24 16:41:59,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 104 remaining) [2024-10-24 16:41:59,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr86REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 104 remaining) [2024-10-24 16:41:59,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 104 remaining) [2024-10-24 16:41:59,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr88REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 104 remaining) [2024-10-24 16:41:59,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr89REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 104 remaining) [2024-10-24 16:41:59,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr90REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 104 remaining) [2024-10-24 16:41:59,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr91REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 104 remaining) [2024-10-24 16:41:59,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr92REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 104 remaining) [2024-10-24 16:41:59,309 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr93REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 104 remaining) [2024-10-24 16:41:59,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr94REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 104 remaining) [2024-10-24 16:41:59,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr95REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 104 remaining) [2024-10-24 16:41:59,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr96REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 104 remaining) [2024-10-24 16:41:59,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr97REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 104 remaining) [2024-10-24 16:41:59,310 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr98REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 104 remaining) [2024-10-24 16:41:59,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr99REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 104 remaining) [2024-10-24 16:41:59,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr100REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 104 remaining) [2024-10-24 16:41:59,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr101REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 104 remaining) [2024-10-24 16:41:59,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr102ASSERT_VIOLATIONMEMORY_LEAK (1 of 104 remaining) [2024-10-24 16:41:59,311 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK (0 of 104 remaining) [2024-10-24 16:41:59,331 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-24 16:41:59,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:41:59,518 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:41:59,520 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 16:41:59,524 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 04:41:59 BoogieIcfgContainer [2024-10-24 16:41:59,524 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 16:41:59,525 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 16:41:59,525 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 16:41:59,525 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 16:41:59,525 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:40:36" (3/4) ... [2024-10-24 16:41:59,527 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-24 16:41:59,544 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 105 nodes and edges [2024-10-24 16:41:59,545 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2024-10-24 16:41:59,548 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-10-24 16:41:59,549 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-24 16:41:59,550 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-24 16:41:59,743 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-24 16:41:59,746 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-24 16:41:59,746 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 16:41:59,746 INFO L158 Benchmark]: Toolchain (without parser) took 85426.15ms. Allocated memory was 146.8MB in the beginning and 725.6MB in the end (delta: 578.8MB). Free memory was 78.3MB in the beginning and 265.1MB in the end (delta: -186.8MB). Peak memory consumption was 392.8MB. Max. memory is 16.1GB. [2024-10-24 16:41:59,747 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 146.8MB. Free memory is still 111.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 16:41:59,747 INFO L158 Benchmark]: CACSL2BoogieTranslator took 514.05ms. Allocated memory was 146.8MB in the beginning and 234.9MB in the end (delta: 88.1MB). Free memory was 78.1MB in the beginning and 200.2MB in the end (delta: -122.1MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2024-10-24 16:41:59,747 INFO L158 Benchmark]: Boogie Procedure Inliner took 113.92ms. Allocated memory is still 234.9MB. Free memory was 200.2MB in the beginning and 194.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 16:41:59,748 INFO L158 Benchmark]: Boogie Preprocessor took 175.24ms. Allocated memory is still 234.9MB. Free memory was 194.9MB in the beginning and 187.6MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 16:41:59,748 INFO L158 Benchmark]: RCFGBuilder took 1068.94ms. Allocated memory is still 234.9MB. Free memory was 187.6MB in the beginning and 189.6MB in the end (delta: -2.0MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2024-10-24 16:41:59,748 INFO L158 Benchmark]: TraceAbstraction took 83323.11ms. Allocated memory was 234.9MB in the beginning and 725.6MB in the end (delta: 490.7MB). Free memory was 188.5MB in the beginning and 288.2MB in the end (delta: -99.7MB). Peak memory consumption was 392.2MB. Max. memory is 16.1GB. [2024-10-24 16:41:59,748 INFO L158 Benchmark]: Witness Printer took 220.87ms. Allocated memory is still 725.6MB. Free memory was 288.2MB in the beginning and 265.1MB in the end (delta: 23.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-24 16:41:59,749 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 146.8MB. Free memory is still 111.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 514.05ms. Allocated memory was 146.8MB in the beginning and 234.9MB in the end (delta: 88.1MB). Free memory was 78.1MB in the beginning and 200.2MB in the end (delta: -122.1MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 113.92ms. Allocated memory is still 234.9MB. Free memory was 200.2MB in the beginning and 194.9MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 175.24ms. Allocated memory is still 234.9MB. Free memory was 194.9MB in the beginning and 187.6MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1068.94ms. Allocated memory is still 234.9MB. Free memory was 187.6MB in the beginning and 189.6MB in the end (delta: -2.0MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. * TraceAbstraction took 83323.11ms. Allocated memory was 234.9MB in the beginning and 725.6MB in the end (delta: 490.7MB). Free memory was 188.5MB in the beginning and 288.2MB in the end (delta: -99.7MB). Peak memory consumption was 392.2MB. Max. memory is 16.1GB. * Witness Printer took 220.87ms. Allocated memory is still 725.6MB. Free memory was 288.2MB in the beginning and 265.1MB in the end (delta: 23.1MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 4]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 130]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 202 locations, 104 error locations. Started 1 CEGAR loops. OverallTime: 83.2s, OverallIterations: 30, TraceHistogramMax: 34, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 58.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3070 SdHoareTripleChecker+Valid, 10.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3070 mSDsluCounter, 7572 SdHoareTripleChecker+Invalid, 8.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6094 mSDsCounter, 369 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22125 IncrementalHoareTripleChecker+Invalid, 22494 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 369 mSolverCounterUnsat, 1478 mSDtfsCounter, 22125 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1562 GetRequests, 1095 SyntacticMatches, 0 SemanticMatches, 467 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7576 ImplicationChecksByTransitivity, 51.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=292occurred in iteration=29, InterpolantAutomatonStates: 331, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 14 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 19.8s InterpolantComputationTime, 2758 NumberOfCodeBlocks, 2572 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 3283 ConstructedInterpolants, 238 QuantifiedInterpolants, 26559 SizeOfPredicates, 16 NumberOfNonLiveVariables, 3834 ConjunctsInSsa, 107 ConjunctsInUnsatCore, 36 InterpolantComputations, 27 PerfectInterpolantSequences, 6211/11331 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 104 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-24 16:41:59,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE