./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/subseq-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/subseq-alloca-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 64bit --witnessprinter.graph.data.programhash ae37599e398d4579dc13aa902332f9c984a4acd0674bb835a0d1e4887393314e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 17:51:26,246 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 17:51:26,296 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-11 17:51:26,299 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 17:51:26,299 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 17:51:26,321 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 17:51:26,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 17:51:26,321 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 17:51:26,322 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 17:51:26,322 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 17:51:26,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 17:51:26,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 17:51:26,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 17:51:26,324 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 17:51:26,325 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 17:51:26,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 17:51:26,325 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 17:51:26,326 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 17:51:26,328 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 17:51:26,328 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 17:51:26,328 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 17:51:26,331 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 17:51:26,331 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 17:51:26,331 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 17:51:26,331 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 17:51:26,331 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 17:51:26,332 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 17:51:26,332 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 17:51:26,332 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 17:51:26,332 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 17:51:26,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:51:26,332 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 17:51:26,332 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 17:51:26,333 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 17:51:26,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 17:51:26,333 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 17:51:26,333 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 17:51:26,333 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 17:51:26,333 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 17:51:26,333 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-clean/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-clean/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ae37599e398d4579dc13aa902332f9c984a4acd0674bb835a0d1e4887393314e [2024-10-11 17:51:26,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 17:51:26,537 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 17:51:26,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 17:51:26,541 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 17:51:26,541 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 17:51:26,542 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/subseq-alloca-1.i [2024-10-11 17:51:27,742 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 17:51:27,913 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 17:51:27,916 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/subseq-alloca-1.i [2024-10-11 17:51:27,926 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1570835ef/bc407f4a001a43b8af894ce2c327762a/FLAG19a8b3fab [2024-10-11 17:51:27,937 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1570835ef/bc407f4a001a43b8af894ce2c327762a [2024-10-11 17:51:27,939 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 17:51:27,940 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 17:51:27,942 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 17:51:27,942 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 17:51:27,946 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 17:51:27,946 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:51:27" (1/1) ... [2024-10-11 17:51:27,948 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a38c6ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:51:27, skipping insertion in model container [2024-10-11 17:51:27,948 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:51:27" (1/1) ... [2024-10-11 17:51:27,975 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 17:51:28,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:51:28,207 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 17:51:28,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 17:51:28,258 INFO L204 MainTranslator]: Completed translation [2024-10-11 17:51:28,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:51:28 WrapperNode [2024-10-11 17:51:28,259 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 17:51:28,260 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 17:51:28,260 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 17:51:28,260 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 17:51:28,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:51:28" (1/1) ... [2024-10-11 17:51:28,273 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:51:28" (1/1) ... [2024-10-11 17:51:28,286 INFO L138 Inliner]: procedures = 111, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 76 [2024-10-11 17:51:28,286 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 17:51:28,287 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 17:51:28,287 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 17:51:28,287 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 17:51:28,294 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:51:28" (1/1) ... [2024-10-11 17:51:28,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:51:28" (1/1) ... [2024-10-11 17:51:28,296 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:51:28" (1/1) ... [2024-10-11 17:51:28,305 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [4, 3]. 57 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2024-10-11 17:51:28,305 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:51:28" (1/1) ... [2024-10-11 17:51:28,305 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:51:28" (1/1) ... [2024-10-11 17:51:28,311 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:51:28" (1/1) ... [2024-10-11 17:51:28,313 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:51:28" (1/1) ... [2024-10-11 17:51:28,317 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:51:28" (1/1) ... [2024-10-11 17:51:28,318 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:51:28" (1/1) ... [2024-10-11 17:51:28,323 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 17:51:28,324 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 17:51:28,324 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 17:51:28,324 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 17:51:28,325 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:51:28" (1/1) ... [2024-10-11 17:51:28,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 17:51:28,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:51:28,355 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 17:51:28,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 17:51:28,393 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 17:51:28,394 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 17:51:28,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 17:51:28,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 17:51:28,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 17:51:28,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 17:51:28,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 17:51:28,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 17:51:28,499 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 17:51:28,501 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 17:51:28,647 INFO L? ?]: Removed 49 outVars from TransFormulas that were not future-live. [2024-10-11 17:51:28,647 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 17:51:28,681 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 17:51:28,682 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 17:51:28,682 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:51:28 BoogieIcfgContainer [2024-10-11 17:51:28,686 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 17:51:28,688 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 17:51:28,688 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 17:51:28,691 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 17:51:28,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:51:27" (1/3) ... [2024-10-11 17:51:28,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66df8d8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:51:28, skipping insertion in model container [2024-10-11 17:51:28,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:51:28" (2/3) ... [2024-10-11 17:51:28,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66df8d8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:51:28, skipping insertion in model container [2024-10-11 17:51:28,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:51:28" (3/3) ... [2024-10-11 17:51:28,695 INFO L112 eAbstractionObserver]: Analyzing ICFG subseq-alloca-1.i [2024-10-11 17:51:28,707 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 17:51:28,708 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2024-10-11 17:51:28,744 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 17:51:28,749 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;@37ea98af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 17:51:28,749 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-10-11 17:51:28,752 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 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-11 17:51:28,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 17:51:28,756 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:28,756 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 17:51:28,756 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:51:28,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:28,760 INFO L85 PathProgramCache]: Analyzing trace with hash 99900276, now seen corresponding path program 1 times [2024-10-11 17:51:28,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:28,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721520157] [2024-10-11 17:51:28,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:28,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:29,003 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-11 17:51:29,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:29,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721520157] [2024-10-11 17:51:29,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721520157] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:29,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:29,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:51:29,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086606555] [2024-10-11 17:51:29,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:29,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:51:29,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:29,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:51:29,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:51:29,036 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 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 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:29,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:29,076 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2024-10-11 17:51:29,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:51:29,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 17:51:29,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:29,084 INFO L225 Difference]: With dead ends: 33 [2024-10-11 17:51:29,084 INFO L226 Difference]: Without dead ends: 32 [2024-10-11 17:51:29,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:51:29,090 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 3 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:29,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 48 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:51:29,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-11 17:51:29,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-11 17:51:29,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:29,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2024-10-11 17:51:29,135 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 5 [2024-10-11 17:51:29,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:29,135 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2024-10-11 17:51:29,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:29,136 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2024-10-11 17:51:29,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 17:51:29,136 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:29,136 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 17:51:29,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 17:51:29,136 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:51:29,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:29,137 INFO L85 PathProgramCache]: Analyzing trace with hash 99900277, now seen corresponding path program 1 times [2024-10-11 17:51:29,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:29,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045006797] [2024-10-11 17:51:29,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:29,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:29,388 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-11 17:51:29,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:29,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045006797] [2024-10-11 17:51:29,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045006797] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:29,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:29,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:51:29,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528210570] [2024-10-11 17:51:29,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:29,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:51:29,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:29,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:51:29,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:51:29,392 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:29,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:29,420 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2024-10-11 17:51:29,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:51:29,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 17:51:29,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:29,421 INFO L225 Difference]: With dead ends: 35 [2024-10-11 17:51:29,421 INFO L226 Difference]: Without dead ends: 35 [2024-10-11 17:51:29,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:51:29,423 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:29,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 61 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:51:29,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-11 17:51:29,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-11 17:51:29,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 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-11 17:51:29,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2024-10-11 17:51:29,427 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 5 [2024-10-11 17:51:29,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:29,428 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2024-10-11 17:51:29,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:29,428 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2024-10-11 17:51:29,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-11 17:51:29,428 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:29,428 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-11 17:51:29,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 17:51:29,428 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:51:29,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:29,429 INFO L85 PathProgramCache]: Analyzing trace with hash 99959859, now seen corresponding path program 1 times [2024-10-11 17:51:29,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:29,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903047001] [2024-10-11 17:51:29,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:29,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:29,588 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-11 17:51:29,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:29,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903047001] [2024-10-11 17:51:29,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903047001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:29,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:29,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:51:29,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259977617] [2024-10-11 17:51:29,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:29,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:51:29,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:29,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:51:29,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:51:29,589 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:29,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:29,616 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2024-10-11 17:51:29,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:51:29,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-11 17:51:29,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:29,619 INFO L225 Difference]: With dead ends: 34 [2024-10-11 17:51:29,619 INFO L226 Difference]: Without dead ends: 34 [2024-10-11 17:51:29,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:51:29,620 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:29,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 82 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:51:29,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-11 17:51:29,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2024-10-11 17:51:29,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 18 states have (on average 2.0) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-11 17:51:29,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2024-10-11 17:51:29,626 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 5 [2024-10-11 17:51:29,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:29,627 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2024-10-11 17:51:29,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:29,627 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2024-10-11 17:51:29,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:51:29,627 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:29,627 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:51:29,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 17:51:29,627 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:51:29,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:29,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1198058751, now seen corresponding path program 1 times [2024-10-11 17:51:29,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:29,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259642121] [2024-10-11 17:51:29,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:29,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:29,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:29,667 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-11 17:51:29,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:29,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259642121] [2024-10-11 17:51:29,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259642121] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:29,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:29,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:51:29,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335614337] [2024-10-11 17:51:29,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:29,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:51:29,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:29,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:51:29,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:51:29,670 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-11 17:51:29,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:29,694 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2024-10-11 17:51:29,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:51:29,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-10-11 17:51:29,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:29,695 INFO L225 Difference]: With dead ends: 30 [2024-10-11 17:51:29,695 INFO L226 Difference]: Without dead ends: 30 [2024-10-11 17:51:29,695 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:51:29,696 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:29,697 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 47 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:51:29,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-10-11 17:51:29,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-10-11 17:51:29,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:29,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-10-11 17:51:29,699 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 6 [2024-10-11 17:51:29,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:29,699 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-10-11 17:51:29,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-11 17:51:29,700 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-10-11 17:51:29,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:51:29,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:29,700 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:51:29,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 17:51:29,700 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:51:29,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:29,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1198058750, now seen corresponding path program 1 times [2024-10-11 17:51:29,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:29,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637032529] [2024-10-11 17:51:29,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:29,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:29,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:29,797 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-11 17:51:29,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:29,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637032529] [2024-10-11 17:51:29,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637032529] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:29,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:29,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:51:29,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653785925] [2024-10-11 17:51:29,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:29,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:51:29,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:29,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:51:29,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:51:29,799 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-11 17:51:29,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:29,817 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2024-10-11 17:51:29,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:51:29,819 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-10-11 17:51:29,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:29,819 INFO L225 Difference]: With dead ends: 33 [2024-10-11 17:51:29,819 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 17:51:29,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:51:29,820 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:29,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:51:29,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 17:51:29,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-10-11 17:51:29,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 32 states have internal predecessors, (38), 0 states have call successors, (0), 0 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-11 17:51:29,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-10-11 17:51:29,825 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 6 [2024-10-11 17:51:29,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:29,826 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-10-11 17:51:29,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-11 17:51:29,826 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-10-11 17:51:29,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-11 17:51:29,826 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:29,826 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-11 17:51:29,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 17:51:29,827 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:51:29,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:29,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1197999168, now seen corresponding path program 1 times [2024-10-11 17:51:29,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:29,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826589197] [2024-10-11 17:51:29,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:29,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:29,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:30,005 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-11 17:51:30,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:30,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826589197] [2024-10-11 17:51:30,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826589197] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:30,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:30,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:51:30,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604855226] [2024-10-11 17:51:30,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:30,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:51:30,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:30,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:51:30,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:51:30,012 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-11 17:51:30,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:30,036 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2024-10-11 17:51:30,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:51:30,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2024-10-11 17:51:30,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:30,038 INFO L225 Difference]: With dead ends: 32 [2024-10-11 17:51:30,038 INFO L226 Difference]: Without dead ends: 32 [2024-10-11 17:51:30,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:51:30,039 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:30,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 76 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:51:30,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-11 17:51:30,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2024-10-11 17:51:30,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 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-11 17:51:30,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2024-10-11 17:51:30,046 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 6 [2024-10-11 17:51:30,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:30,046 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2024-10-11 17:51:30,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 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-11 17:51:30,046 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2024-10-11 17:51:30,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 17:51:30,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:30,048 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:30,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 17:51:30,048 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:51:30,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:30,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1514886147, now seen corresponding path program 1 times [2024-10-11 17:51:30,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:30,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545587646] [2024-10-11 17:51:30,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:30,050 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:30,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:30,094 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-11 17:51:30,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:30,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545587646] [2024-10-11 17:51:30,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545587646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:30,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:30,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:51:30,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539969006] [2024-10-11 17:51:30,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:30,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:51:30,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:30,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:51:30,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:51:30,096 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:30,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:30,136 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2024-10-11 17:51:30,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:51:30,137 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 17:51:30,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:30,137 INFO L225 Difference]: With dead ends: 27 [2024-10-11 17:51:30,137 INFO L226 Difference]: Without dead ends: 27 [2024-10-11 17:51:30,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:51:30,139 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 19 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:30,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 36 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:51:30,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2024-10-11 17:51:30,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2024-10-11 17:51:30,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.7777777777777777) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 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-11 17:51:30,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2024-10-11 17:51:30,143 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 7 [2024-10-11 17:51:30,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:30,143 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2024-10-11 17:51:30,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:30,144 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2024-10-11 17:51:30,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 17:51:30,145 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:30,145 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:30,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 17:51:30,145 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:51:30,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:30,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1514886148, now seen corresponding path program 1 times [2024-10-11 17:51:30,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:30,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192950987] [2024-10-11 17:51:30,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:30,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:30,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:30,236 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-11 17:51:30,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:30,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192950987] [2024-10-11 17:51:30,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192950987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:30,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:30,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 17:51:30,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834109792] [2024-10-11 17:51:30,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:30,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:51:30,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:30,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:51:30,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:51:30,239 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:30,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:30,292 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2024-10-11 17:51:30,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 17:51:30,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 17:51:30,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:30,293 INFO L225 Difference]: With dead ends: 44 [2024-10-11 17:51:30,293 INFO L226 Difference]: Without dead ends: 44 [2024-10-11 17:51:30,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 17:51:30,295 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 20 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:30,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 88 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:51:30,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-11 17:51:30,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 35. [2024-10-11 17:51:30,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 34 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-11 17:51:30,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2024-10-11 17:51:30,301 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 47 transitions. Word has length 7 [2024-10-11 17:51:30,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:30,301 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 47 transitions. [2024-10-11 17:51:30,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:30,301 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2024-10-11 17:51:30,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 17:51:30,301 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:30,301 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:30,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 17:51:30,301 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:51:30,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:30,302 INFO L85 PathProgramCache]: Analyzing trace with hash -188276008, now seen corresponding path program 1 times [2024-10-11 17:51:30,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:30,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411174980] [2024-10-11 17:51:30,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:30,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:30,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:30,337 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-11 17:51:30,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:30,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411174980] [2024-10-11 17:51:30,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411174980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:30,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:30,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:51:30,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102656755] [2024-10-11 17:51:30,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:30,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:51:30,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:30,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:51:30,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:51:30,340 INFO L87 Difference]: Start difference. First operand 35 states and 47 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:30,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:30,362 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2024-10-11 17:51:30,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:51:30,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 17:51:30,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:30,365 INFO L225 Difference]: With dead ends: 32 [2024-10-11 17:51:30,365 INFO L226 Difference]: Without dead ends: 32 [2024-10-11 17:51:30,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:51:30,366 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 10 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:30,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 24 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:51:30,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-11 17:51:30,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2024-10-11 17:51:30,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 31 states have internal predecessors, (42), 0 states have call successors, (0), 0 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-11 17:51:30,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2024-10-11 17:51:30,370 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 9 [2024-10-11 17:51:30,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:30,370 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2024-10-11 17:51:30,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:30,371 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2024-10-11 17:51:30,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 17:51:30,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:30,371 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:30,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 17:51:30,371 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:51:30,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:30,372 INFO L85 PathProgramCache]: Analyzing trace with hash -188276007, now seen corresponding path program 1 times [2024-10-11 17:51:30,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:30,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102107052] [2024-10-11 17:51:30,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:30,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:30,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:30,480 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-11 17:51:30,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:30,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102107052] [2024-10-11 17:51:30,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102107052] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:30,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:30,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 17:51:30,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264596067] [2024-10-11 17:51:30,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:30,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 17:51:30,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:30,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 17:51:30,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:51:30,483 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:30,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:30,519 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2024-10-11 17:51:30,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 17:51:30,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-11 17:51:30,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:30,520 INFO L225 Difference]: With dead ends: 42 [2024-10-11 17:51:30,520 INFO L226 Difference]: Without dead ends: 42 [2024-10-11 17:51:30,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 17:51:30,521 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 8 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:30,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 50 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:51:30,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-11 17:51:30,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2024-10-11 17:51:30,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 33 states have (on average 1.5454545454545454) internal successors, (51), 38 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:30,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 51 transitions. [2024-10-11 17:51:30,526 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 51 transitions. Word has length 9 [2024-10-11 17:51:30,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:30,527 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 51 transitions. [2024-10-11 17:51:30,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:30,527 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 51 transitions. [2024-10-11 17:51:30,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 17:51:30,527 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:30,527 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:30,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 17:51:30,527 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:51:30,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:30,528 INFO L85 PathProgramCache]: Analyzing trace with hash 789903873, now seen corresponding path program 1 times [2024-10-11 17:51:30,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:30,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552123651] [2024-10-11 17:51:30,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:30,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:30,624 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-11 17:51:30,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:30,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552123651] [2024-10-11 17:51:30,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552123651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:30,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:30,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 17:51:30,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496876448] [2024-10-11 17:51:30,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:30,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 17:51:30,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:30,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 17:51:30,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:51:30,628 INFO L87 Difference]: Start difference. First operand 39 states and 51 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 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-11 17:51:30,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:30,647 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2024-10-11 17:51:30,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 17:51:30,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2024-10-11 17:51:30,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:30,648 INFO L225 Difference]: With dead ends: 38 [2024-10-11 17:51:30,649 INFO L226 Difference]: Without dead ends: 34 [2024-10-11 17:51:30,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 17:51:30,649 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 16 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:30,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 36 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:51:30,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-10-11 17:51:30,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-10-11 17:51:30,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 33 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:30,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 44 transitions. [2024-10-11 17:51:30,653 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 44 transitions. Word has length 13 [2024-10-11 17:51:30,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:30,653 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 44 transitions. [2024-10-11 17:51:30,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 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-11 17:51:30,654 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2024-10-11 17:51:30,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-11 17:51:30,654 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:30,654 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:30,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 17:51:30,654 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:51:30,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:30,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1240854758, now seen corresponding path program 1 times [2024-10-11 17:51:30,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:30,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812084700] [2024-10-11 17:51:30,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:30,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:30,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:30,677 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:30,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:30,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812084700] [2024-10-11 17:51:30,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812084700] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:30,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:30,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 17:51:30,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150562555] [2024-10-11 17:51:30,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:30,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 17:51:30,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:30,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 17:51:30,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 17:51:30,679 INFO L87 Difference]: Start difference. First operand 34 states and 44 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:30,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:30,691 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2024-10-11 17:51:30,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 17:51:30,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-11 17:51:30,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:30,693 INFO L225 Difference]: With dead ends: 37 [2024-10-11 17:51:30,693 INFO L226 Difference]: Without dead ends: 36 [2024-10-11 17:51:30,697 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-11 17:51:30,698 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:30,698 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 35 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:51:30,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-11 17:51:30,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2024-10-11 17:51:30,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 34 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:30,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 44 transitions. [2024-10-11 17:51:30,700 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 44 transitions. Word has length 14 [2024-10-11 17:51:30,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:30,700 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 44 transitions. [2024-10-11 17:51:30,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:30,700 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 44 transitions. [2024-10-11 17:51:30,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 17:51:30,700 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:30,700 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:30,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 17:51:30,701 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:51:30,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:30,701 INFO L85 PathProgramCache]: Analyzing trace with hash -712413074, now seen corresponding path program 1 times [2024-10-11 17:51:30,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:30,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673415569] [2024-10-11 17:51:30,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:30,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:30,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:30,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:30,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:30,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673415569] [2024-10-11 17:51:30,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673415569] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:30,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 17:51:30,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 17:51:30,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841174251] [2024-10-11 17:51:30,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:30,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 17:51:30,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:30,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 17:51:30,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 17:51:30,821 INFO L87 Difference]: Start difference. First operand 35 states and 44 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 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-11 17:51:30,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:30,859 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2024-10-11 17:51:30,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 17:51:30,860 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 17:51:30,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:30,860 INFO L225 Difference]: With dead ends: 41 [2024-10-11 17:51:30,860 INFO L226 Difference]: Without dead ends: 35 [2024-10-11 17:51:30,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 17:51:30,861 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 2 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:30,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 90 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:51:30,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-11 17:51:30,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-11 17:51:30,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:30,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2024-10-11 17:51:30,862 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 15 [2024-10-11 17:51:30,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:30,863 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2024-10-11 17:51:30,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 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-11 17:51:30,863 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2024-10-11 17:51:30,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 17:51:30,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:30,863 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:30,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 17:51:30,865 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:51:30,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:30,866 INFO L85 PathProgramCache]: Analyzing trace with hash -1723530324, now seen corresponding path program 1 times [2024-10-11 17:51:30,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:30,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496644658] [2024-10-11 17:51:30,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:30,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:30,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:31,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:31,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:31,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496644658] [2024-10-11 17:51:31,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496644658] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:51:31,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720846836] [2024-10-11 17:51:31,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:31,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:51:31,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:51:31,042 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:51:31,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 17:51:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:31,099 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 17:51:31,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:51:31,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 17:51:31,244 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 17:51:31,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:51:31,250 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 29 treesize of output 20 [2024-10-11 17:51:31,268 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:31,268 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 17:51:31,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720846836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 17:51:31,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 17:51:31,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 13 [2024-10-11 17:51:31,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717955418] [2024-10-11 17:51:31,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 17:51:31,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 17:51:31,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:31,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 17:51:31,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2024-10-11 17:51:31,270 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 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-11 17:51:31,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:31,327 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2024-10-11 17:51:31,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 17:51:31,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 17:51:31,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:31,328 INFO L225 Difference]: With dead ends: 42 [2024-10-11 17:51:31,328 INFO L226 Difference]: Without dead ends: 35 [2024-10-11 17:51:31,328 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-10-11 17:51:31,328 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:31,329 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 73 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 17:51:31,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-10-11 17:51:31,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-10-11 17:51:31,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.4) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 0 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-11 17:51:31,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2024-10-11 17:51:31,330 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 15 [2024-10-11 17:51:31,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:31,330 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2024-10-11 17:51:31,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 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-11 17:51:31,330 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2024-10-11 17:51:31,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-10-11 17:51:31,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:31,331 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:31,346 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 17:51:31,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-10-11 17:51:31,538 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:51:31,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:31,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1984630958, now seen corresponding path program 1 times [2024-10-11 17:51:31,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:31,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481484702] [2024-10-11 17:51:31,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:31,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:31,741 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:31,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:31,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481484702] [2024-10-11 17:51:31,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481484702] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:51:31,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542501746] [2024-10-11 17:51:31,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:31,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:51:31,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:51:31,745 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:51:31,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 17:51:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:31,817 INFO L255 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 17:51:31,818 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:51:31,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-11 17:51:31,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:51:31,940 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 32 treesize of output 29 [2024-10-11 17:51:32,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:32,032 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:51:32,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-10-11 17:51:32,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-11 17:51:32,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-10-11 17:51:32,212 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:32,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542501746] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:51:32,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:51:32,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 18 [2024-10-11 17:51:32,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410685262] [2024-10-11 17:51:32,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:51:32,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 17:51:32,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:32,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 17:51:32,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2024-10-11 17:51:32,214 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-11 17:51:32,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:32,447 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2024-10-11 17:51:32,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 17:51:32,448 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-10-11 17:51:32,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:32,448 INFO L225 Difference]: With dead ends: 54 [2024-10-11 17:51:32,448 INFO L226 Difference]: Without dead ends: 54 [2024-10-11 17:51:32,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2024-10-11 17:51:32,449 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 68 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:32,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 97 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:51:32,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-11 17:51:32,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 36. [2024-10-11 17:51:32,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.34375) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:32,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2024-10-11 17:51:32,451 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 15 [2024-10-11 17:51:32,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:32,451 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2024-10-11 17:51:32,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 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-11 17:51:32,451 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2024-10-11 17:51:32,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 17:51:32,452 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:32,452 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:32,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-11 17:51:32,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 17:51:32,653 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:51:32,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:32,653 INFO L85 PathProgramCache]: Analyzing trace with hash 264920323, now seen corresponding path program 1 times [2024-10-11 17:51:32,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:32,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095297854] [2024-10-11 17:51:32,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:32,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:32,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:32,900 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-11 17:51:32,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:32,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095297854] [2024-10-11 17:51:32,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095297854] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:51:32,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077927469] [2024-10-11 17:51:32,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:32,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:51:32,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:51:32,902 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:51:32,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 17:51:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:32,956 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-11 17:51:32,957 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:51:32,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-11 17:51:33,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:51:33,037 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 32 treesize of output 29 [2024-10-11 17:51:33,125 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-11 17:51:33,125 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:51:33,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-10-11 17:51:33,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-10-11 17:51:33,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-11 17:51:33,262 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-11 17:51:33,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077927469] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:51:33,263 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:51:33,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 17 [2024-10-11 17:51:33,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761226756] [2024-10-11 17:51:33,263 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:51:33,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 17:51:33,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:33,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 17:51:33,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2024-10-11 17:51:33,264 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 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-11 17:51:33,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:33,528 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2024-10-11 17:51:33,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 17:51:33,529 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-10-11 17:51:33,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:33,529 INFO L225 Difference]: With dead ends: 58 [2024-10-11 17:51:33,530 INFO L226 Difference]: Without dead ends: 55 [2024-10-11 17:51:33,530 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2024-10-11 17:51:33,530 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 47 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:33,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 66 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 17:51:33,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-11 17:51:33,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 44. [2024-10-11 17:51:33,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 43 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-11 17:51:33,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2024-10-11 17:51:33,532 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 17 [2024-10-11 17:51:33,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:33,533 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2024-10-11 17:51:33,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 18 states have internal predecessors, (40), 0 states have call successors, (0), 0 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-11 17:51:33,533 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2024-10-11 17:51:33,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 17:51:33,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:33,533 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:33,546 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 17:51:33,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:51:33,734 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:51:33,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:33,735 INFO L85 PathProgramCache]: Analyzing trace with hash 964616984, now seen corresponding path program 2 times [2024-10-11 17:51:33,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:33,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695862956] [2024-10-11 17:51:33,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:33,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:34,064 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:34,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:34,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695862956] [2024-10-11 17:51:34,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695862956] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:51:34,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98065199] [2024-10-11 17:51:34,064 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:51:34,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:51:34,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:51:34,066 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:51:34,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 17:51:34,122 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:51:34,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:51:34,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-10-11 17:51:34,125 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:51:34,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-11 17:51:38,466 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2024-10-11 17:51:38,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 33 [2024-10-11 17:51:38,534 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:38,534 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:51:38,868 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-10-11 17:51:38,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2024-10-11 17:51:38,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2024-10-11 17:51:38,950 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:38,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98065199] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:51:38,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:51:38,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 26 [2024-10-11 17:51:38,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328059720] [2024-10-11 17:51:38,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:51:38,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-10-11 17:51:38,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:38,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-10-11 17:51:38,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=608, Unknown=1, NotChecked=0, Total=702 [2024-10-11 17:51:38,953 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 27 states, 26 states have (on average 2.230769230769231) internal successors, (58), 27 states have internal predecessors, (58), 0 states have call successors, (0), 0 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-11 17:51:45,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-11 17:51:48,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:48,789 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2024-10-11 17:51:48,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-11 17:51:48,789 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.230769230769231) internal successors, (58), 27 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-10-11 17:51:48,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:48,789 INFO L225 Difference]: With dead ends: 110 [2024-10-11 17:51:48,789 INFO L226 Difference]: Without dead ends: 110 [2024-10-11 17:51:48,790 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=336, Invalid=1821, Unknown=5, NotChecked=0, Total=2162 [2024-10-11 17:51:48,790 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 177 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 12 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:48,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 180 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 459 Invalid, 21 Unknown, 0 Unchecked, 8.0s Time] [2024-10-11 17:51:48,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-10-11 17:51:48,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 71. [2024-10-11 17:51:48,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 70 states have internal predecessors, (84), 0 states have call successors, (0), 0 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-11 17:51:48,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 84 transitions. [2024-10-11 17:51:48,793 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 84 transitions. Word has length 23 [2024-10-11 17:51:48,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:48,793 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 84 transitions. [2024-10-11 17:51:48,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.230769230769231) internal successors, (58), 27 states have internal predecessors, (58), 0 states have call successors, (0), 0 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-11 17:51:48,793 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 84 transitions. [2024-10-11 17:51:48,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 17:51:48,794 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:48,794 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:48,811 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 17:51:48,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 17:51:48,999 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:51:48,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:48,999 INFO L85 PathProgramCache]: Analyzing trace with hash -715965203, now seen corresponding path program 2 times [2024-10-11 17:51:48,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:48,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961171823] [2024-10-11 17:51:48,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:48,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:49,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:49,441 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:49,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:49,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961171823] [2024-10-11 17:51:49,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961171823] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:51:49,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774624910] [2024-10-11 17:51:49,442 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 17:51:49,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:51:49,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:51:49,443 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:51:49,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 17:51:49,506 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 17:51:49,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:51:49,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-11 17:51:49,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:51:49,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-11 17:51:49,789 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2024-10-11 17:51:49,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 33 [2024-10-11 17:51:49,846 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:49,846 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:51:50,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-10-11 17:51:50,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2024-10-11 17:51:50,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2024-10-11 17:51:50,186 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:50,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774624910] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:51:50,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:51:50,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 27 [2024-10-11 17:51:50,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245640387] [2024-10-11 17:51:50,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:51:50,187 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 17:51:50,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:51:50,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 17:51:50,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2024-10-11 17:51:50,188 INFO L87 Difference]: Start difference. First operand 71 states and 84 transitions. Second operand has 28 states, 27 states have (on average 2.4444444444444446) internal successors, (66), 28 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:50,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:51:50,922 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2024-10-11 17:51:50,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 17:51:50,923 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.4444444444444446) internal successors, (66), 28 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-10-11 17:51:50,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:51:50,923 INFO L225 Difference]: With dead ends: 81 [2024-10-11 17:51:50,923 INFO L226 Difference]: Without dead ends: 79 [2024-10-11 17:51:50,924 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=272, Invalid=1368, Unknown=0, NotChecked=0, Total=1640 [2024-10-11 17:51:50,924 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 36 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 17:51:50,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 110 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 17:51:50,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-11 17:51:50,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 49. [2024-10-11 17:51:50,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.125) internal successors, (54), 48 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:50,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2024-10-11 17:51:50,926 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 25 [2024-10-11 17:51:50,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:51:50,927 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2024-10-11 17:51:50,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.4444444444444446) internal successors, (66), 28 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 17:51:50,927 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2024-10-11 17:51:50,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-10-11 17:51:50,927 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 17:51:50,927 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:51:50,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 17:51:51,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-10-11 17:51:51,128 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-10-11 17:51:51,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 17:51:51,128 INFO L85 PathProgramCache]: Analyzing trace with hash -770040234, now seen corresponding path program 3 times [2024-10-11 17:51:51,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 17:51:51,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000250548] [2024-10-11 17:51:51,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 17:51:51,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 17:51:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 17:51:51,597 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:51:51,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 17:51:51,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000250548] [2024-10-11 17:51:51,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000250548] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 17:51:51,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1612806347] [2024-10-11 17:51:51,597 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 17:51:51,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:51:51,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 17:51:51,599 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 17:51:51,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 17:51:51,672 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-10-11 17:51:51,672 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 17:51:51,674 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-11 17:51:51,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 17:51:51,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2024-10-11 17:51:52,500 INFO L349 Elim1Store]: treesize reduction 4, result has 87.9 percent of original size [2024-10-11 17:51:52,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 49 [2024-10-11 17:51:52,669 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 7 proven. 33 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-10-11 17:51:52,669 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 17:52:00,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 56 [2024-10-11 17:52:00,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 17:52:00,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 106 treesize of output 176 [2024-10-11 17:52:00,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-10-11 17:52:00,441 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 17:52:00,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1612806347] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 17:52:00,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 17:52:00,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 20] total 41 [2024-10-11 17:52:00,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011849264] [2024-10-11 17:52:00,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 17:52:00,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-10-11 17:52:00,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 17:52:00,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-10-11 17:52:00,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1499, Unknown=3, NotChecked=0, Total=1722 [2024-10-11 17:52:00,443 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 42 states, 41 states have (on average 2.7804878048780486) internal successors, (114), 42 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-11 17:52:01,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 17:52:01,786 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2024-10-11 17:52:01,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-11 17:52:01,787 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.7804878048780486) internal successors, (114), 42 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) Word has length 47 [2024-10-11 17:52:01,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 17:52:01,787 INFO L225 Difference]: With dead ends: 71 [2024-10-11 17:52:01,787 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 17:52:01,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 56 SyntacticMatches, 8 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1049 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=804, Invalid=3749, Unknown=3, NotChecked=0, Total=4556 [2024-10-11 17:52:01,789 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 101 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 17:52:01,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 345 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 17:52:01,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 17:52:01,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 17:52:01,789 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-11 17:52:01,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 17:52:01,789 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2024-10-11 17:52:01,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 17:52:01,789 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 17:52:01,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.7804878048780486) internal successors, (114), 42 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-11 17:52:01,790 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 17:52:01,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 17:52:01,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 15 remaining) [2024-10-11 17:52:01,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 15 remaining) [2024-10-11 17:52:01,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 15 remaining) [2024-10-11 17:52:01,794 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 15 remaining) [2024-10-11 17:52:01,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 15 remaining) [2024-10-11 17:52:01,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 15 remaining) [2024-10-11 17:52:01,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 15 remaining) [2024-10-11 17:52:01,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 15 remaining) [2024-10-11 17:52:01,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 15 remaining) [2024-10-11 17:52:01,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 15 remaining) [2024-10-11 17:52:01,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 15 remaining) [2024-10-11 17:52:01,795 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 15 remaining) [2024-10-11 17:52:01,796 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 15 remaining) [2024-10-11 17:52:01,796 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 15 remaining) [2024-10-11 17:52:01,796 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (0 of 15 remaining) [2024-10-11 17:52:01,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 17:52:02,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 17:52:02,003 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 17:52:02,005 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 17:52:02,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:52:02 BoogieIcfgContainer [2024-10-11 17:52:02,009 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 17:52:02,009 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 17:52:02,009 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 17:52:02,010 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 17:52:02,010 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:51:28" (3/4) ... [2024-10-11 17:52:02,012 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 17:52:02,019 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-10-11 17:52:02,019 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 17:52:02,020 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-10-11 17:52:02,020 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 17:52:02,092 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 17:52:02,093 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 17:52:02,093 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 17:52:02,094 INFO L158 Benchmark]: Toolchain (without parser) took 34153.61ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 93.6MB in the beginning and 173.8MB in the end (delta: -80.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:52:02,094 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 121.6MB. Free memory is still 82.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 17:52:02,094 INFO L158 Benchmark]: CACSL2BoogieTranslator took 317.68ms. Allocated memory is still 161.5MB. Free memory was 93.3MB in the beginning and 75.3MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 17:52:02,094 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.26ms. Allocated memory is still 161.5MB. Free memory was 75.3MB in the beginning and 73.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:52:02,094 INFO L158 Benchmark]: Boogie Preprocessor took 36.73ms. Allocated memory is still 161.5MB. Free memory was 73.5MB in the beginning and 71.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 17:52:02,095 INFO L158 Benchmark]: RCFGBuilder took 362.61ms. Allocated memory is still 161.5MB. Free memory was 71.4MB in the beginning and 121.7MB in the end (delta: -50.3MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. [2024-10-11 17:52:02,095 INFO L158 Benchmark]: TraceAbstraction took 33320.95ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 120.9MB in the beginning and 178.5MB in the end (delta: -57.6MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2024-10-11 17:52:02,098 INFO L158 Benchmark]: Witness Printer took 84.00ms. Allocated memory is still 234.9MB. Free memory was 178.5MB in the beginning and 173.8MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 17:52:02,099 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 121.6MB. Free memory is still 82.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 317.68ms. Allocated memory is still 161.5MB. Free memory was 93.3MB in the beginning and 75.3MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.26ms. Allocated memory is still 161.5MB. Free memory was 75.3MB in the beginning and 73.5MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.73ms. Allocated memory is still 161.5MB. Free memory was 73.5MB in the beginning and 71.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 362.61ms. Allocated memory is still 161.5MB. Free memory was 71.4MB in the beginning and 121.7MB in the end (delta: -50.3MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB. * TraceAbstraction took 33320.95ms. Allocated memory was 161.5MB in the beginning and 234.9MB in the end (delta: 73.4MB). Free memory was 120.9MB in the beginning and 178.5MB in the end (delta: -57.6MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * Witness Printer took 84.00ms. Allocated memory is still 234.9MB. Free memory was 178.5MB in the beginning and 173.8MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. 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: 560]: 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, 34 locations, 15 error locations. Started 1 CEGAR loops. OverallTime: 33.3s, OverallIterations: 19, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 13.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 21 mSolverCounterUnknown, 511 SdHoareTripleChecker+Valid, 9.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 511 mSDsluCounter, 1600 SdHoareTripleChecker+Invalid, 9.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1202 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2274 IncrementalHoareTripleChecker+Invalid, 2353 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 398 mSDtfsCounter, 2274 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 433 GetRequests, 182 SyntacticMatches, 13 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1917 ImplicationChecksByTransitivity, 16.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=17, InterpolantAutomatonStates: 159, 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, 19 MinimizatonAttempts, 117 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 18.1s InterpolantComputationTime, 391 NumberOfCodeBlocks, 391 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 488 ConstructedInterpolants, 96 QuantifiedInterpolants, 8068 SizeOfPredicates, 26 NumberOfNonLiveVariables, 824 ConjunctsInSsa, 141 ConjunctsInUnsatCore, 30 InterpolantComputations, 14 PerfectInterpolantSequences, 58/343 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 15 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-11 17:52:02,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE