./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-dietlibc/dirname-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/dirname-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c17dc684f0856c2cb34d9c0f310a5ac71ddc07f596d7c8c46ee2d12464efc754 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 10:32:39,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 10:32:40,024 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-13 10:32:40,029 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 10:32:40,031 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 10:32:40,066 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 10:32:40,068 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 10:32:40,069 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 10:32:40,069 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 10:32:40,071 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 10:32:40,072 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 10:32:40,072 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 10:32:40,072 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 10:32:40,074 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 10:32:40,074 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 10:32:40,075 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 10:32:40,075 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 10:32:40,075 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 10:32:40,076 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 10:32:40,076 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 10:32:40,076 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 10:32:40,078 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 10:32:40,079 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 10:32:40,079 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 10:32:40,079 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 10:32:40,079 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 10:32:40,080 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 10:32:40,080 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 10:32:40,080 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 10:32:40,080 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 10:32:40,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:32:40,081 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 10:32:40,081 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 10:32:40,081 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 10:32:40,081 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 10:32:40,082 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 10:32:40,082 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 10:32:40,083 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 10:32:40,083 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 10:32:40,083 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c17dc684f0856c2cb34d9c0f310a5ac71ddc07f596d7c8c46ee2d12464efc754 [2024-10-13 10:32:40,392 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 10:32:40,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 10:32:40,416 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 10:32:40,417 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 10:32:40,418 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 10:32:40,419 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/dirname-2.i [2024-10-13 10:32:41,778 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 10:32:42,040 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 10:32:42,041 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-dietlibc/dirname-2.i [2024-10-13 10:32:42,056 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33dd02977/b5d522c426464305a9e14cebfc35ea69/FLAGfddd0120c [2024-10-13 10:32:42,358 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33dd02977/b5d522c426464305a9e14cebfc35ea69 [2024-10-13 10:32:42,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 10:32:42,363 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 10:32:42,365 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 10:32:42,367 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 10:32:42,371 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 10:32:42,372 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:32:42" (1/1) ... [2024-10-13 10:32:42,373 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62fa5c06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:42, skipping insertion in model container [2024-10-13 10:32:42,373 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:32:42" (1/1) ... [2024-10-13 10:32:42,420 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 10:32:42,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:32:42,768 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 10:32:42,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 10:32:42,850 INFO L204 MainTranslator]: Completed translation [2024-10-13 10:32:42,850 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:42 WrapperNode [2024-10-13 10:32:42,850 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 10:32:42,851 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 10:32:42,851 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 10:32:42,851 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 10:32:42,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:42" (1/1) ... [2024-10-13 10:32:42,868 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:42" (1/1) ... [2024-10-13 10:32:42,885 INFO L138 Inliner]: procedures = 114, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2024-10-13 10:32:42,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 10:32:42,886 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 10:32:42,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 10:32:42,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 10:32:42,907 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:42" (1/1) ... [2024-10-13 10:32:42,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:42" (1/1) ... [2024-10-13 10:32:42,911 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:42" (1/1) ... [2024-10-13 10:32:42,922 INFO L175 MemorySlicer]: Split 9 memory accesses to 1 slices as follows [9]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 4 writes are split as follows [4]. [2024-10-13 10:32:42,923 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:42" (1/1) ... [2024-10-13 10:32:42,923 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:42" (1/1) ... [2024-10-13 10:32:42,928 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:42" (1/1) ... [2024-10-13 10:32:42,933 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:42" (1/1) ... [2024-10-13 10:32:42,934 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:42" (1/1) ... [2024-10-13 10:32:42,935 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:42" (1/1) ... [2024-10-13 10:32:42,941 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 10:32:42,946 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 10:32:42,946 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 10:32:42,946 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 10:32:42,948 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:42" (1/1) ... [2024-10-13 10:32:42,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 10:32:42,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:32:42,983 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 10:32:42,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 10:32:43,027 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 10:32:43,027 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 10:32:43,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 10:32:43,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 10:32:43,028 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 10:32:43,028 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 10:32:43,126 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 10:32:43,128 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 10:32:43,352 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2024-10-13 10:32:43,352 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 10:32:43,386 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 10:32:43,387 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-13 10:32:43,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:32:43 BoogieIcfgContainer [2024-10-13 10:32:43,388 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 10:32:43,391 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 10:32:43,392 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 10:32:43,395 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 10:32:43,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:32:42" (1/3) ... [2024-10-13 10:32:43,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19610eaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:32:43, skipping insertion in model container [2024-10-13 10:32:43,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:32:42" (2/3) ... [2024-10-13 10:32:43,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19610eaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:32:43, skipping insertion in model container [2024-10-13 10:32:43,397 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:32:43" (3/3) ... [2024-10-13 10:32:43,398 INFO L112 eAbstractionObserver]: Analyzing ICFG dirname-2.i [2024-10-13 10:32:43,415 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 10:32:43,415 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 19 error locations. [2024-10-13 10:32:43,464 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 10:32:43,470 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;@79ef0361, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 10:32:43,470 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2024-10-13 10:32:43,473 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 43 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:32:43,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-13 10:32:43,477 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:32:43,478 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-13 10:32:43,478 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-13 10:32:43,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:32:43,482 INFO L85 PathProgramCache]: Analyzing trace with hash 140572, now seen corresponding path program 1 times [2024-10-13 10:32:43,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:32:43,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064808523] [2024-10-13 10:32:43,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:32:43,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:32:43,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:32:43,617 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-13 10:32:43,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:32:43,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064808523] [2024-10-13 10:32:43,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064808523] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:32:43,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:32:43,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 10:32:43,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620531172] [2024-10-13 10:32:43,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:32:43,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:32:43,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:32:43,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:32:43,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:32:43,651 INFO L87 Difference]: Start difference. First operand has 44 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 43 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:32:43,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:32:43,706 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2024-10-13 10:32:43,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:32:43,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-13 10:32:43,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:32:43,715 INFO L225 Difference]: With dead ends: 45 [2024-10-13 10:32:43,715 INFO L226 Difference]: Without dead ends: 43 [2024-10-13 10:32:43,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-13 10:32:43,720 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:32:43,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:32:43,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-13 10:32:43,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-13 10:32:43,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 42 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:32:43,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2024-10-13 10:32:43,746 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 3 [2024-10-13 10:32:43,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:32:43,746 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2024-10-13 10:32:43,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:32:43,747 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2024-10-13 10:32:43,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-13 10:32:43,747 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:32:43,747 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-13 10:32:43,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 10:32:43,747 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-13 10:32:43,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:32:43,748 INFO L85 PathProgramCache]: Analyzing trace with hash 140532, now seen corresponding path program 1 times [2024-10-13 10:32:43,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:32:43,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134370040] [2024-10-13 10:32:43,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:32:43,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:32:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:32:43,838 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-13 10:32:43,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:32:43,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134370040] [2024-10-13 10:32:43,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134370040] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:32:43,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:32:43,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:32:43,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038713757] [2024-10-13 10:32:43,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:32:43,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 10:32:43,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:32:43,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 10:32:43,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 10:32:43,841 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:32:43,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:32:43,878 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2024-10-13 10:32:43,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 10:32:43,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-13 10:32:43,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:32:43,880 INFO L225 Difference]: With dead ends: 42 [2024-10-13 10:32:43,881 INFO L226 Difference]: Without dead ends: 42 [2024-10-13 10:32:43,881 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-13 10:32:43,882 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 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-13 10:32:43,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:32:43,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-13 10:32:43,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-10-13 10:32:43,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 2.0416666666666665) internal successors, (49), 41 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-13 10:32:43,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2024-10-13 10:32:43,892 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 3 [2024-10-13 10:32:43,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:32:43,893 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2024-10-13 10:32:43,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:32:43,893 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2024-10-13 10:32:43,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-13 10:32:43,893 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:32:43,894 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-13 10:32:43,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 10:32:43,894 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-13 10:32:43,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:32:43,896 INFO L85 PathProgramCache]: Analyzing trace with hash 140533, now seen corresponding path program 1 times [2024-10-13 10:32:43,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:32:43,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784457567] [2024-10-13 10:32:43,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:32:43,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:32:43,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:32:44,101 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-13 10:32:44,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:32:44,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784457567] [2024-10-13 10:32:44,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784457567] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:32:44,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:32:44,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:32:44,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289015155] [2024-10-13 10:32:44,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:32:44,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:32:44,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:32:44,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:32:44,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:32:44,106 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:32:44,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:32:44,122 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2024-10-13 10:32:44,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:32:44,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-13 10:32:44,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:32:44,124 INFO L225 Difference]: With dead ends: 41 [2024-10-13 10:32:44,124 INFO L226 Difference]: Without dead ends: 41 [2024-10-13 10:32:44,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 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-13 10:32:44,125 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:32:44,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:32:44,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-13 10:32:44,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-10-13 10:32:44,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 24 states have (on average 2.0) internal successors, (48), 40 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:32:44,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2024-10-13 10:32:44,131 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 3 [2024-10-13 10:32:44,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:32:44,131 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2024-10-13 10:32:44,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:32:44,131 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2024-10-13 10:32:44,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 10:32:44,132 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:32:44,132 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 10:32:44,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 10:32:44,132 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-13 10:32:44,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:32:44,133 INFO L85 PathProgramCache]: Analyzing trace with hash -105174826, now seen corresponding path program 1 times [2024-10-13 10:32:44,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:32:44,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962304166] [2024-10-13 10:32:44,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:32:44,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:32:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:32:44,289 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-13 10:32:44,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:32:44,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962304166] [2024-10-13 10:32:44,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962304166] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:32:44,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:32:44,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:32:44,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228243711] [2024-10-13 10:32:44,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:32:44,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:32:44,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:32:44,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:32:44,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:32:44,294 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-13 10:32:44,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:32:44,418 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2024-10-13 10:32:44,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:32:44,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-13 10:32:44,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:32:44,420 INFO L225 Difference]: With dead ends: 39 [2024-10-13 10:32:44,420 INFO L226 Difference]: Without dead ends: 39 [2024-10-13 10:32:44,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:32:44,421 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 41 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:32:44,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 30 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:32:44,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-13 10:32:44,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2024-10-13 10:32:44,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.875) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 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-13 10:32:44,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2024-10-13 10:32:44,447 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 6 [2024-10-13 10:32:44,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:32:44,447 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2024-10-13 10:32:44,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-13 10:32:44,448 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2024-10-13 10:32:44,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 10:32:44,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:32:44,449 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 10:32:44,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 10:32:44,450 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-13 10:32:44,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:32:44,451 INFO L85 PathProgramCache]: Analyzing trace with hash -105174825, now seen corresponding path program 1 times [2024-10-13 10:32:44,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:32:44,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095117169] [2024-10-13 10:32:44,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:32:44,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:32:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:32:44,661 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-13 10:32:44,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:32:44,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095117169] [2024-10-13 10:32:44,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095117169] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:32:44,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:32:44,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:32:44,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469396566] [2024-10-13 10:32:44,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:32:44,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:32:44,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:32:44,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:32:44,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:32:44,667 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-13 10:32:44,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:32:44,787 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2024-10-13 10:32:44,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:32:44,788 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-13 10:32:44,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:32:44,788 INFO L225 Difference]: With dead ends: 44 [2024-10-13 10:32:44,789 INFO L226 Difference]: Without dead ends: 44 [2024-10-13 10:32:44,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:32:44,790 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 48 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:32:44,790 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 40 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:32:44,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-13 10:32:44,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2024-10-13 10:32:44,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 40 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-13 10:32:44,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2024-10-13 10:32:44,801 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 6 [2024-10-13 10:32:44,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:32:44,801 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2024-10-13 10:32:44,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 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-13 10:32:44,802 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2024-10-13 10:32:44,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-13 10:32:44,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:32:44,804 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-13 10:32:44,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 10:32:44,804 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-13 10:32:44,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:32:44,805 INFO L85 PathProgramCache]: Analyzing trace with hash -105173903, now seen corresponding path program 1 times [2024-10-13 10:32:44,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:32:44,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051953452] [2024-10-13 10:32:44,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:32:44,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:32:44,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:32:44,861 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-13 10:32:44,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:32:44,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051953452] [2024-10-13 10:32:44,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051953452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:32:44,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:32:44,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 10:32:44,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581187958] [2024-10-13 10:32:44,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:32:44,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:32:44,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:32:44,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:32:44,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:32:44,865 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand has 4 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-13 10:32:44,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:32:44,898 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2024-10-13 10:32:44,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:32:44,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 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-13 10:32:44,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:32:44,899 INFO L225 Difference]: With dead ends: 42 [2024-10-13 10:32:44,901 INFO L226 Difference]: Without dead ends: 42 [2024-10-13 10:32:44,901 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-13 10:32:44,902 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 37 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:32:44,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 59 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:32:44,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-13 10:32:44,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2024-10-13 10:32:44,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.7777777777777777) internal successors, (48), 40 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:32:44,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2024-10-13 10:32:44,910 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 6 [2024-10-13 10:32:44,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:32:44,910 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2024-10-13 10:32:44,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-13 10:32:44,910 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2024-10-13 10:32:44,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-13 10:32:44,911 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:32:44,911 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:32:44,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 10:32:44,911 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-13 10:32:44,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:32:44,912 INFO L85 PathProgramCache]: Analyzing trace with hash -475109909, now seen corresponding path program 1 times [2024-10-13 10:32:44,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:32:44,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424063725] [2024-10-13 10:32:44,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:32:44,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:32:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:32:45,257 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:32:45,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:32:45,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424063725] [2024-10-13 10:32:45,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424063725] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:32:45,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2006493212] [2024-10-13 10:32:45,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:32:45,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:32:45,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:32:45,262 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:32:45,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 10:32:45,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:32:45,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 10:32:45,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:32:45,449 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-13 10:32:45,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:32:45,719 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 18 treesize of output 19 [2024-10-13 10:32:45,789 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-13 10:32:45,789 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:32:46,062 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-13 10:32:46,069 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-13 10:32:46,077 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-13 10:32:46,090 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-13 10:32:46,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2006493212] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:32:46,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:32:46,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 16 [2024-10-13 10:32:46,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446644098] [2024-10-13 10:32:46,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:32:46,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-13 10:32:46,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:32:46,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 10:32:46,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-10-13 10:32:46,093 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand has 17 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 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-13 10:32:46,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:32:46,542 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2024-10-13 10:32:46,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 10:32:46,542 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-13 10:32:46,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:32:46,543 INFO L225 Difference]: With dead ends: 48 [2024-10-13 10:32:46,543 INFO L226 Difference]: Without dead ends: 48 [2024-10-13 10:32:46,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2024-10-13 10:32:46,544 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 112 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:32:46,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 75 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:32:46,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-13 10:32:46,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2024-10-13 10:32:46,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 41 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:32:46,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2024-10-13 10:32:46,548 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 10 [2024-10-13 10:32:46,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:32:46,548 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2024-10-13 10:32:46,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.625) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 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-13 10:32:46,548 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2024-10-13 10:32:46,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 10:32:46,549 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:32:46,549 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:32:46,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 10:32:46,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:32:46,752 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-13 10:32:46,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:32:46,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1314128894, now seen corresponding path program 1 times [2024-10-13 10:32:46,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:32:46,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461993607] [2024-10-13 10:32:46,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:32:46,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:32:46,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:32:46,843 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-13 10:32:46,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:32:46,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461993607] [2024-10-13 10:32:46,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461993607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:32:46,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:32:46,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 10:32:46,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499192345] [2024-10-13 10:32:46,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:32:46,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 10:32:46,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:32:46,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 10:32:46,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:32:46,848 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:32:47,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:32:47,025 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2024-10-13 10:32:47,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 10:32:47,026 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-13 10:32:47,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:32:47,026 INFO L225 Difference]: With dead ends: 52 [2024-10-13 10:32:47,026 INFO L226 Difference]: Without dead ends: 52 [2024-10-13 10:32:47,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-10-13 10:32:47,027 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 64 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 10:32:47,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 21 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 10:32:47,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-13 10:32:47,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2024-10-13 10:32:47,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.641025641025641) internal successors, (64), 49 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:32:47,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2024-10-13 10:32:47,036 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 12 [2024-10-13 10:32:47,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:32:47,036 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2024-10-13 10:32:47,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:32:47,038 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2024-10-13 10:32:47,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 10:32:47,038 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:32:47,039 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:32:47,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 10:32:47,039 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-13 10:32:47,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:32:47,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1314128893, now seen corresponding path program 1 times [2024-10-13 10:32:47,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:32:47,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276585612] [2024-10-13 10:32:47,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:32:47,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:32:47,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:32:47,156 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-13 10:32:47,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:32:47,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276585612] [2024-10-13 10:32:47,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276585612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:32:47,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:32:47,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 10:32:47,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339438780] [2024-10-13 10:32:47,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:32:47,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 10:32:47,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:32:47,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 10:32:47,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 10:32:47,158 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:32:47,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:32:47,215 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2024-10-13 10:32:47,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 10:32:47,215 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-13 10:32:47,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:32:47,216 INFO L225 Difference]: With dead ends: 52 [2024-10-13 10:32:47,216 INFO L226 Difference]: Without dead ends: 52 [2024-10-13 10:32:47,216 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-13 10:32:47,217 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 9 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:32:47,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 123 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:32:47,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-13 10:32:47,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-13 10:32:47,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 51 states have internal predecessors, (65), 0 states have call successors, (0), 0 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-13 10:32:47,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2024-10-13 10:32:47,224 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 12 [2024-10-13 10:32:47,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:32:47,225 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2024-10-13 10:32:47,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:32:47,225 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2024-10-13 10:32:47,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 10:32:47,226 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:32:47,226 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:32:47,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 10:32:47,226 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-13 10:32:47,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:32:47,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1256870592, now seen corresponding path program 1 times [2024-10-13 10:32:47,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:32:47,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146389753] [2024-10-13 10:32:47,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:32:47,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:32:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:32:47,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:32:47,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:32:47,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146389753] [2024-10-13 10:32:47,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146389753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:32:47,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:32:47,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 10:32:47,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868246054] [2024-10-13 10:32:47,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:32:47,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 10:32:47,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:32:47,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 10:32:47,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:32:47,289 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:32:47,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:32:47,325 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2024-10-13 10:32:47,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 10:32:47,326 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-13 10:32:47,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:32:47,326 INFO L225 Difference]: With dead ends: 51 [2024-10-13 10:32:47,326 INFO L226 Difference]: Without dead ends: 51 [2024-10-13 10:32:47,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 10:32:47,327 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 2 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:32:47,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 130 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:32:47,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-13 10:32:47,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2024-10-13 10:32:47,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.525) internal successors, (61), 49 states have internal predecessors, (61), 0 states have call successors, (0), 0 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-13 10:32:47,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2024-10-13 10:32:47,334 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 12 [2024-10-13 10:32:47,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:32:47,334 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2024-10-13 10:32:47,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:32:47,334 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2024-10-13 10:32:47,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-13 10:32:47,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:32:47,335 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:32:47,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 10:32:47,335 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-13 10:32:47,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:32:47,336 INFO L85 PathProgramCache]: Analyzing trace with hash -308282732, now seen corresponding path program 1 times [2024-10-13 10:32:47,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:32:47,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835780042] [2024-10-13 10:32:47,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:32:47,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:32:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:32:47,412 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-13 10:32:47,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:32:47,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835780042] [2024-10-13 10:32:47,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835780042] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 10:32:47,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 10:32:47,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 10:32:47,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288271240] [2024-10-13 10:32:47,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 10:32:47,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 10:32:47,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:32:47,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 10:32:47,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 10:32:47,414 INFO L87 Difference]: Start difference. First operand 50 states and 61 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-13 10:32:47,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:32:47,443 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2024-10-13 10:32:47,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 10:32:47,444 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-13 10:32:47,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:32:47,444 INFO L225 Difference]: With dead ends: 49 [2024-10-13 10:32:47,445 INFO L226 Difference]: Without dead ends: 44 [2024-10-13 10:32:47,445 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-13 10:32:47,445 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 27 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 10:32:47,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 50 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 10:32:47,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-13 10:32:47,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-13 10:32:47,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 35 states have (on average 1.457142857142857) internal successors, (51), 43 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-13 10:32:47,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2024-10-13 10:32:47,449 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 13 [2024-10-13 10:32:47,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:32:47,449 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2024-10-13 10:32:47,449 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-13 10:32:47,449 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2024-10-13 10:32:47,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 10:32:47,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:32:47,450 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-13 10:32:47,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 10:32:47,450 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-13 10:32:47,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:32:47,451 INFO L85 PathProgramCache]: Analyzing trace with hash -120260353, now seen corresponding path program 2 times [2024-10-13 10:32:47,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:32:47,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847332700] [2024-10-13 10:32:47,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:32:47,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:32:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:32:47,978 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:32:47,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:32:47,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847332700] [2024-10-13 10:32:47,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847332700] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:32:47,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [351774758] [2024-10-13 10:32:47,979 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:32:47,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:32:47,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:32:47,983 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:32:47,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 10:32:48,054 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:32:48,054 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:32:48,055 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-13 10:32:48,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:32:48,090 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-13 10:32:56,338 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-13 10:32:56,338 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 34 treesize of output 19 [2024-10-13 10:32:56,352 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:32:56,352 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:32:56,809 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-13 10:32:56,819 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 40 treesize of output 34 [2024-10-13 10:32:56,826 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 67 treesize of output 53 [2024-10-13 10:32:56,880 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:32:56,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [351774758] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:32:56,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:32:56,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 11] total 30 [2024-10-13 10:32:56,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140101576] [2024-10-13 10:32:56,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:32:56,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-13 10:32:56,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:32:56,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-13 10:32:56,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=814, Unknown=3, NotChecked=0, Total=930 [2024-10-13 10:32:56,884 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 31 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 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-13 10:33:04,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:33:10,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:33:10,356 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2024-10-13 10:33:10,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-10-13 10:33:10,357 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 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) Word has length 14 [2024-10-13 10:33:10,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:33:10,359 INFO L225 Difference]: With dead ends: 76 [2024-10-13 10:33:10,359 INFO L226 Difference]: Without dead ends: 76 [2024-10-13 10:33:10,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 636 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=571, Invalid=2498, Unknown=11, NotChecked=0, Total=3080 [2024-10-13 10:33:10,362 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 179 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 14 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-10-13 10:33:10,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 65 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 739 Invalid, 3 Unknown, 0 Unchecked, 5.7s Time] [2024-10-13 10:33:10,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-13 10:33:10,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 53. [2024-10-13 10:33:10,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 52 states have internal predecessors, (65), 0 states have call successors, (0), 0 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-13 10:33:10,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2024-10-13 10:33:10,375 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 14 [2024-10-13 10:33:10,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:33:10,376 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2024-10-13 10:33:10,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 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-13 10:33:10,376 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2024-10-13 10:33:10,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-13 10:33:10,376 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:33:10,376 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:33:10,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 10:33:10,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-13 10:33:10,578 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-13 10:33:10,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:33:10,578 INFO L85 PathProgramCache]: Analyzing trace with hash -120200771, now seen corresponding path program 1 times [2024-10-13 10:33:10,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:33:10,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697848136] [2024-10-13 10:33:10,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:33:10,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:33:10,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:33:11,016 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:33:11,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:33:11,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697848136] [2024-10-13 10:33:11,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697848136] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:33:11,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885690461] [2024-10-13 10:33:11,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:33:11,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:33:11,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:33:11,020 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:33:11,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 10:33:11,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:33:11,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-13 10:33:11,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:33:11,109 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-13 10:33:11,799 INFO L349 Elim1Store]: treesize reduction 4, result has 82.6 percent of original size [2024-10-13 10:33:11,799 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 85 treesize of output 52 [2024-10-13 10:33:11,877 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:33:11,877 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:33:12,584 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 178 treesize of output 156 [2024-10-13 10:33:12,613 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:33:12,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 309 treesize of output 304 [2024-10-13 10:33:12,627 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 96 treesize of output 90 [2024-10-13 10:33:13,103 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:33:13,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885690461] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:33:13,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:33:13,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 12] total 28 [2024-10-13 10:33:13,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273238152] [2024-10-13 10:33:13,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:33:13,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-10-13 10:33:13,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:33:13,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-10-13 10:33:13,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=691, Unknown=0, NotChecked=0, Total=812 [2024-10-13 10:33:13,108 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand has 29 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 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-13 10:33:16,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:33:16,199 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2024-10-13 10:33:16,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-10-13 10:33:16,200 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 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) Word has length 14 [2024-10-13 10:33:16,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:33:16,200 INFO L225 Difference]: With dead ends: 82 [2024-10-13 10:33:16,200 INFO L226 Difference]: Without dead ends: 82 [2024-10-13 10:33:16,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 555 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=637, Invalid=2443, Unknown=0, NotChecked=0, Total=3080 [2024-10-13 10:33:16,202 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 314 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 10:33:16,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 57 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 10:33:16,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-13 10:33:16,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 58. [2024-10-13 10:33:16,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 49 states have (on average 1.4285714285714286) internal successors, (70), 57 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:33:16,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2024-10-13 10:33:16,205 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 14 [2024-10-13 10:33:16,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:33:16,206 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2024-10-13 10:33:16,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.3571428571428572) internal successors, (38), 29 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-13 10:33:16,206 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2024-10-13 10:33:16,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 10:33:16,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:33:16,207 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:33:16,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 10:33:16,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:33:16,408 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-13 10:33:16,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:33:16,409 INFO L85 PathProgramCache]: Analyzing trace with hash 451136341, now seen corresponding path program 1 times [2024-10-13 10:33:16,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:33:16,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105330875] [2024-10-13 10:33:16,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:33:16,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:33:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:33:16,624 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:33:16,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:33:16,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105330875] [2024-10-13 10:33:16,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105330875] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:33:16,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1566294839] [2024-10-13 10:33:16,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:33:16,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:33:16,625 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:33:16,627 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:33:16,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 10:33:16,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:33:16,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-13 10:33:16,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:33:16,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:33:16,829 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:33:16,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 10:33:16,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2024-10-13 10:33:17,012 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:33:17,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1566294839] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:33:17,012 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:33:17,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 21 [2024-10-13 10:33:17,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204466919] [2024-10-13 10:33:17,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:33:17,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-13 10:33:17,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:33:17,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-13 10:33:17,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=395, Unknown=0, NotChecked=0, Total=462 [2024-10-13 10:33:17,015 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand has 22 states, 21 states have (on average 2.0) internal successors, (42), 22 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-13 10:33:17,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 10:33:17,429 INFO L93 Difference]: Finished difference Result 87 states and 108 transitions. [2024-10-13 10:33:17,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 10:33:17,429 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 22 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) Word has length 16 [2024-10-13 10:33:17,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 10:33:17,430 INFO L225 Difference]: With dead ends: 87 [2024-10-13 10:33:17,430 INFO L226 Difference]: Without dead ends: 87 [2024-10-13 10:33:17,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=198, Invalid=1134, Unknown=0, NotChecked=0, Total=1332 [2024-10-13 10:33:17,431 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 103 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 10:33:17,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 54 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 10:33:17,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-13 10:33:17,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 59. [2024-10-13 10:33:17,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 51 states have (on average 1.392156862745098) internal successors, (71), 58 states have internal predecessors, (71), 0 states have call successors, (0), 0 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-13 10:33:17,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 71 transitions. [2024-10-13 10:33:17,434 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 71 transitions. Word has length 16 [2024-10-13 10:33:17,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 10:33:17,434 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 71 transitions. [2024-10-13 10:33:17,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.0) internal successors, (42), 22 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-13 10:33:17,435 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2024-10-13 10:33:17,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-13 10:33:17,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 10:33:17,435 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 10:33:17,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-13 10:33:17,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:33:17,636 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 16 more)] === [2024-10-13 10:33:17,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 10:33:17,636 INFO L85 PathProgramCache]: Analyzing trace with hash 855059665, now seen corresponding path program 2 times [2024-10-13 10:33:17,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 10:33:17,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671846453] [2024-10-13 10:33:17,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 10:33:17,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 10:33:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 10:33:18,142 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:33:18,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 10:33:18,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671846453] [2024-10-13 10:33:18,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671846453] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 10:33:18,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312654573] [2024-10-13 10:33:18,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 10:33:18,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 10:33:18,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 10:33:18,146 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 10:33:18,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 10:33:18,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 10:33:18,213 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 10:33:18,214 INFO L255 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-10-13 10:33:18,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 10:33:18,246 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-13 10:33:35,966 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-10-13 10:33:35,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 27 [2024-10-13 10:33:35,974 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 9 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:33:35,974 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 10:33:36,426 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-13 10:33:36,432 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 57 treesize of output 49 [2024-10-13 10:33:36,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 64 [2024-10-13 10:33:36,480 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 10:33:36,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312654573] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 10:33:36,480 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 10:33:36,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 13] total 35 [2024-10-13 10:33:36,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570182425] [2024-10-13 10:33:36,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 10:33:36,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-10-13 10:33:36,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 10:33:36,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-10-13 10:33:36,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1109, Unknown=12, NotChecked=0, Total=1260 [2024-10-13 10:33:36,482 INFO L87 Difference]: Start difference. First operand 59 states and 71 transitions. Second operand has 36 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 36 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 10:33:41,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.78s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:33:42,889 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:33:50,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:33:54,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:33:56,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.50s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-13 10:34:09,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]