./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-optional-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/forester-heap/dll-optional-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c592bb1d39faa1e5f3d20603a8bfbb8fe6cff4de59ea35fafbddd50b8917b41 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 18:54:32,890 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 18:54:32,960 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 18:54:32,965 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 18:54:32,966 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 18:54:32,987 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 18:54:32,987 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 18:54:32,988 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 18:54:32,988 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 18:54:32,988 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 18:54:32,989 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 18:54:32,989 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 18:54:32,989 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 18:54:32,990 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 18:54:32,990 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 18:54:32,990 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 18:54:32,990 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 18:54:32,991 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 18:54:32,991 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 18:54:32,991 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 18:54:32,991 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 18:54:32,992 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 18:54:32,992 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 18:54:32,992 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 18:54:32,992 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 18:54:32,993 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 18:54:32,993 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 18:54:32,993 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 18:54:32,993 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 18:54:32,994 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 18:54:32,994 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 18:54:32,994 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 18:54:32,994 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 18:54:32,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:54:32,995 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 18:54:32,995 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 18:54:32,995 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 18:54:32,995 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 18:54:32,995 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 18:54:32,996 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 18:54:32,996 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 18:54:32,996 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 18:54:32,996 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1c592bb1d39faa1e5f3d20603a8bfbb8fe6cff4de59ea35fafbddd50b8917b41 [2024-11-22 18:54:33,199 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 18:54:33,220 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 18:54:33,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 18:54:33,223 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 18:54:33,223 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 18:54:33,224 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-optional-1.i [2024-11-22 18:54:34,604 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 18:54:34,788 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 18:54:34,788 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-optional-1.i [2024-11-22 18:54:34,815 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/253c6230a/10316351f46d41ca8eeb4c540df21959/FLAGde6c5159c [2024-11-22 18:54:34,847 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/253c6230a/10316351f46d41ca8eeb4c540df21959 [2024-11-22 18:54:34,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 18:54:34,852 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 18:54:34,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 18:54:34,857 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 18:54:34,864 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 18:54:34,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:54:34" (1/1) ... [2024-11-22 18:54:34,870 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@661351f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:54:34, skipping insertion in model container [2024-11-22 18:54:34,870 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:54:34" (1/1) ... [2024-11-22 18:54:34,918 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:54:35,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:54:35,174 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 18:54:35,208 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:54:35,238 INFO L204 MainTranslator]: Completed translation [2024-11-22 18:54:35,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:54:35 WrapperNode [2024-11-22 18:54:35,238 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 18:54:35,239 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 18:54:35,239 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 18:54:35,239 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 18:54:35,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:54:35" (1/1) ... [2024-11-22 18:54:35,258 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:54:35" (1/1) ... [2024-11-22 18:54:35,284 INFO L138 Inliner]: procedures = 119, calls = 45, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 145 [2024-11-22 18:54:35,285 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 18:54:35,286 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 18:54:35,287 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 18:54:35,288 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 18:54:35,296 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:54:35" (1/1) ... [2024-11-22 18:54:35,296 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:54:35" (1/1) ... [2024-11-22 18:54:35,302 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:54:35" (1/1) ... [2024-11-22 18:54:35,333 INFO L175 MemorySlicer]: Split 34 memory accesses to 2 slices as follows [2, 32]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 19 writes are split as follows [0, 19]. [2024-11-22 18:54:35,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:54:35" (1/1) ... [2024-11-22 18:54:35,335 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:54:35" (1/1) ... [2024-11-22 18:54:35,344 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:54:35" (1/1) ... [2024-11-22 18:54:35,347 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:54:35" (1/1) ... [2024-11-22 18:54:35,355 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:54:35" (1/1) ... [2024-11-22 18:54:35,356 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:54:35" (1/1) ... [2024-11-22 18:54:35,358 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 18:54:35,359 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 18:54:35,359 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 18:54:35,359 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 18:54:35,359 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:54:35" (1/1) ... [2024-11-22 18:54:35,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:54:35,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:54:35,389 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 18:54:35,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 18:54:35,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 18:54:35,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 18:54:35,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 18:54:35,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 18:54:35,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 18:54:35,432 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 18:54:35,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 18:54:35,433 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 18:54:35,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 18:54:35,433 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 18:54:35,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 18:54:35,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 18:54:35,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 18:54:35,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 18:54:35,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 18:54:35,537 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 18:54:35,539 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 18:54:35,900 INFO L? ?]: Removed 148 outVars from TransFormulas that were not future-live. [2024-11-22 18:54:35,901 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 18:54:35,912 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 18:54:35,912 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-22 18:54:35,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:54:35 BoogieIcfgContainer [2024-11-22 18:54:35,913 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 18:54:35,914 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 18:54:35,914 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 18:54:35,917 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 18:54:35,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:54:34" (1/3) ... [2024-11-22 18:54:35,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ac816ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:54:35, skipping insertion in model container [2024-11-22 18:54:35,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:54:35" (2/3) ... [2024-11-22 18:54:35,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ac816ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:54:35, skipping insertion in model container [2024-11-22 18:54:35,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:54:35" (3/3) ... [2024-11-22 18:54:35,919 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-optional-1.i [2024-11-22 18:54:35,932 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 18:54:35,932 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2024-11-22 18:54:35,977 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 18:54:35,982 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;@7acb5699, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 18:54:35,982 INFO L334 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2024-11-22 18:54:35,986 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 82 states have (on average 2.097560975609756) internal successors, (172), 154 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:36,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-22 18:54:36,018 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:54:36,019 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-22 18:54:36,019 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-22 18:54:36,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:54:36,030 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2024-11-22 18:54:36,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:54:36,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339990187] [2024-11-22 18:54:36,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:54:36,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:54:36,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:54:36,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:54:36,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:54:36,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339990187] [2024-11-22 18:54:36,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339990187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:54:36,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:54:36,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:54:36,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540159597] [2024-11-22 18:54:36,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:54:36,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:54:36,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:54:36,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:54:36,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:54:36,285 INFO L87 Difference]: Start difference. First operand has 155 states, 82 states have (on average 2.097560975609756) internal successors, (172), 154 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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-11-22 18:54:36,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:54:36,435 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2024-11-22 18:54:36,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:54:36,441 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-11-22 18:54:36,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:54:36,447 INFO L225 Difference]: With dead ends: 148 [2024-11-22 18:54:36,447 INFO L226 Difference]: Without dead ends: 146 [2024-11-22 18:54:36,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:54:36,452 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 121 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:54:36,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 90 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:54:36,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-22 18:54:36,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2024-11-22 18:54:36,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 83 states have (on average 1.891566265060241) internal successors, (157), 144 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:36,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 157 transitions. [2024-11-22 18:54:36,488 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 157 transitions. Word has length 3 [2024-11-22 18:54:36,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:54:36,488 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 157 transitions. [2024-11-22 18:54:36,489 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-11-22 18:54:36,489 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 157 transitions. [2024-11-22 18:54:36,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-22 18:54:36,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:54:36,489 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-22 18:54:36,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 18:54:36,490 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-22 18:54:36,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:54:36,490 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2024-11-22 18:54:36,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:54:36,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130177227] [2024-11-22 18:54:36,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:54:36,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:54:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:54:36,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:54:36,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:54:36,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130177227] [2024-11-22 18:54:36,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130177227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:54:36,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:54:36,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 18:54:36,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308889949] [2024-11-22 18:54:36,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:54:36,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:54:36,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:54:36,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:54:36,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:54:36,592 INFO L87 Difference]: Start difference. First operand 145 states and 157 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-11-22 18:54:36,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:54:36,691 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2024-11-22 18:54:36,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:54:36,691 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-11-22 18:54:36,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:54:36,692 INFO L225 Difference]: With dead ends: 136 [2024-11-22 18:54:36,692 INFO L226 Difference]: Without dead ends: 136 [2024-11-22 18:54:36,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:54:36,693 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 110 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:54:36,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 101 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:54:36,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-22 18:54:36,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-22 18:54:36,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 83 states have (on average 1.783132530120482) internal successors, (148), 135 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:36,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2024-11-22 18:54:36,700 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 3 [2024-11-22 18:54:36,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:54:36,700 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2024-11-22 18:54:36,700 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-11-22 18:54:36,700 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2024-11-22 18:54:36,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-22 18:54:36,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:54:36,701 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:54:36,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 18:54:36,701 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-22 18:54:36,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:54:36,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1483656077, now seen corresponding path program 1 times [2024-11-22 18:54:36,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:54:36,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524245094] [2024-11-22 18:54:36,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:54:36,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:54:36,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:54:36,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:54:36,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:54:36,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524245094] [2024-11-22 18:54:36,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524245094] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:54:36,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:54:36,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:54:36,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420643831] [2024-11-22 18:54:36,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:54:36,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:54:36,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:54:36,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:54:36,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:54:36,861 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand has 5 states, 4 states have (on average 3.0) 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-11-22 18:54:37,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:54:37,040 INFO L93 Difference]: Finished difference Result 177 states and 194 transitions. [2024-11-22 18:54:37,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:54:37,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) 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-11-22 18:54:37,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:54:37,042 INFO L225 Difference]: With dead ends: 177 [2024-11-22 18:54:37,042 INFO L226 Difference]: Without dead ends: 177 [2024-11-22 18:54:37,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:54:37,043 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 46 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:54:37,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 335 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:54:37,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-22 18:54:37,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 135. [2024-11-22 18:54:37,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 83 states have (on average 1.7710843373493976) internal successors, (147), 134 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:37,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2024-11-22 18:54:37,073 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 12 [2024-11-22 18:54:37,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:54:37,073 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2024-11-22 18:54:37,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) 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-11-22 18:54:37,074 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2024-11-22 18:54:37,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-22 18:54:37,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:54:37,074 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:54:37,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 18:54:37,078 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-22 18:54:37,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:54:37,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1483656076, now seen corresponding path program 1 times [2024-11-22 18:54:37,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:54:37,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473898791] [2024-11-22 18:54:37,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:54:37,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:54:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:54:37,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:54:37,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:54:37,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473898791] [2024-11-22 18:54:37,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473898791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:54:37,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:54:37,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:54:37,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651572605] [2024-11-22 18:54:37,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:54:37,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:54:37,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:54:37,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:54:37,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:54:37,510 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand has 5 states, 4 states have (on average 3.0) 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-11-22 18:54:37,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:54:37,664 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2024-11-22 18:54:37,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:54:37,664 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) 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-11-22 18:54:37,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:54:37,665 INFO L225 Difference]: With dead ends: 134 [2024-11-22 18:54:37,666 INFO L226 Difference]: Without dead ends: 134 [2024-11-22 18:54:37,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:54:37,668 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:54:37,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 370 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:54:37,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-22 18:54:37,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-22 18:54:37,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 83 states have (on average 1.7590361445783131) internal successors, (146), 133 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:37,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2024-11-22 18:54:37,676 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 12 [2024-11-22 18:54:37,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:54:37,677 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2024-11-22 18:54:37,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) 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-11-22 18:54:37,677 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2024-11-22 18:54:37,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-22 18:54:37,677 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:54:37,678 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:54:37,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 18:54:37,678 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-22 18:54:37,678 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:54:37,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1002115696, now seen corresponding path program 1 times [2024-11-22 18:54:37,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:54:37,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327264008] [2024-11-22 18:54:37,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:54:37,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:54:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:54:37,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:54:37,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:54:37,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327264008] [2024-11-22 18:54:37,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327264008] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:54:37,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:54:37,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:54:37,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1341433360] [2024-11-22 18:54:37,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:54:37,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:54:37,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:54:37,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:54:37,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:54:37,747 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-11-22 18:54:37,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:54:37,869 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2024-11-22 18:54:37,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:54:37,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-11-22 18:54:37,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:54:37,870 INFO L225 Difference]: With dead ends: 128 [2024-11-22 18:54:37,870 INFO L226 Difference]: Without dead ends: 128 [2024-11-22 18:54:37,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:54:37,871 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 157 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:54:37,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 76 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:54:37,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-22 18:54:37,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 126. [2024-11-22 18:54:37,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 89 states have (on average 1.6067415730337078) internal successors, (143), 125 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:37,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 143 transitions. [2024-11-22 18:54:37,877 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 143 transitions. Word has length 13 [2024-11-22 18:54:37,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:54:37,878 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 143 transitions. [2024-11-22 18:54:37,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-11-22 18:54:37,878 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 143 transitions. [2024-11-22 18:54:37,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-22 18:54:37,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:54:37,878 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:54:37,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 18:54:37,879 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-22 18:54:37,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:54:37,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1002115697, now seen corresponding path program 1 times [2024-11-22 18:54:37,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:54:37,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526266277] [2024-11-22 18:54:37,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:54:37,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:54:37,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:54:37,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:54:37,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:54:37,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526266277] [2024-11-22 18:54:37,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526266277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:54:37,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:54:37,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:54:37,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859916470] [2024-11-22 18:54:37,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:54:37,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:54:37,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:54:37,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:54:37,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:54:37,996 INFO L87 Difference]: Start difference. First operand 126 states and 143 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-11-22 18:54:38,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:54:38,235 INFO L93 Difference]: Finished difference Result 168 states and 187 transitions. [2024-11-22 18:54:38,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:54:38,236 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-11-22 18:54:38,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:54:38,237 INFO L225 Difference]: With dead ends: 168 [2024-11-22 18:54:38,237 INFO L226 Difference]: Without dead ends: 168 [2024-11-22 18:54:38,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:54:38,238 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 171 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:54:38,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 127 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:54:38,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-22 18:54:38,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 157. [2024-11-22 18:54:38,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 120 states have (on average 1.5333333333333334) internal successors, (184), 156 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:38,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 184 transitions. [2024-11-22 18:54:38,243 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 184 transitions. Word has length 13 [2024-11-22 18:54:38,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:54:38,243 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 184 transitions. [2024-11-22 18:54:38,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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-11-22 18:54:38,243 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 184 transitions. [2024-11-22 18:54:38,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-22 18:54:38,244 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:54:38,244 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:54:38,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 18:54:38,244 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-22 18:54:38,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:54:38,244 INFO L85 PathProgramCache]: Analyzing trace with hash -288943149, now seen corresponding path program 1 times [2024-11-22 18:54:38,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:54:38,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644643759] [2024-11-22 18:54:38,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:54:38,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:54:38,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:54:38,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:54:38,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:54:38,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644643759] [2024-11-22 18:54:38,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644643759] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:54:38,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:54:38,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:54:38,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575393588] [2024-11-22 18:54:38,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:54:38,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:54:38,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:54:38,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:54:38,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:54:38,336 INFO L87 Difference]: Start difference. First operand 157 states and 184 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:38,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:54:38,467 INFO L93 Difference]: Finished difference Result 156 states and 182 transitions. [2024-11-22 18:54:38,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:54:38,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-22 18:54:38,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:54:38,469 INFO L225 Difference]: With dead ends: 156 [2024-11-22 18:54:38,469 INFO L226 Difference]: Without dead ends: 156 [2024-11-22 18:54:38,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:54:38,470 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 4 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:54:38,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 312 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:54:38,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-22 18:54:38,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-11-22 18:54:38,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 120 states have (on average 1.5166666666666666) internal successors, (182), 155 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:38,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 182 transitions. [2024-11-22 18:54:38,474 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 182 transitions. Word has length 16 [2024-11-22 18:54:38,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:54:38,474 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 182 transitions. [2024-11-22 18:54:38,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:38,474 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 182 transitions. [2024-11-22 18:54:38,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-22 18:54:38,475 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:54:38,475 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:54:38,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 18:54:38,475 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-22 18:54:38,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:54:38,476 INFO L85 PathProgramCache]: Analyzing trace with hash -288943148, now seen corresponding path program 1 times [2024-11-22 18:54:38,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:54:38,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071357683] [2024-11-22 18:54:38,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:54:38,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:54:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:54:38,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:54:38,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:54:38,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071357683] [2024-11-22 18:54:38,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071357683] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:54:38,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:54:38,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:54:38,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938781523] [2024-11-22 18:54:38,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:54:38,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:54:38,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:54:38,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:54:38,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:54:38,625 INFO L87 Difference]: Start difference. First operand 156 states and 182 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:38,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:54:38,761 INFO L93 Difference]: Finished difference Result 155 states and 180 transitions. [2024-11-22 18:54:38,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:54:38,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-22 18:54:38,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:54:38,762 INFO L225 Difference]: With dead ends: 155 [2024-11-22 18:54:38,762 INFO L226 Difference]: Without dead ends: 155 [2024-11-22 18:54:38,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:54:38,763 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 2 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:54:38,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 303 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:54:38,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-22 18:54:38,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-11-22 18:54:38,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 120 states have (on average 1.5) internal successors, (180), 154 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:38,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 180 transitions. [2024-11-22 18:54:38,772 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 180 transitions. Word has length 16 [2024-11-22 18:54:38,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:54:38,772 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 180 transitions. [2024-11-22 18:54:38,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:38,772 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 180 transitions. [2024-11-22 18:54:38,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-22 18:54:38,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:54:38,775 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:54:38,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 18:54:38,775 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-22 18:54:38,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:54:38,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1504578714, now seen corresponding path program 1 times [2024-11-22 18:54:38,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:54:38,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477374081] [2024-11-22 18:54:38,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:54:38,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:54:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:54:38,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:54:38,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:54:38,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477374081] [2024-11-22 18:54:38,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477374081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:54:38,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:54:38,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:54:38,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219448339] [2024-11-22 18:54:38,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:54:38,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:54:38,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:54:38,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:54:38,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:54:38,813 INFO L87 Difference]: Start difference. First operand 155 states and 180 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:38,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:54:38,900 INFO L93 Difference]: Finished difference Result 168 states and 188 transitions. [2024-11-22 18:54:38,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:54:38,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-22 18:54:38,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:54:38,903 INFO L225 Difference]: With dead ends: 168 [2024-11-22 18:54:38,903 INFO L226 Difference]: Without dead ends: 168 [2024-11-22 18:54:38,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:54:38,904 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 167 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:54:38,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 170 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:54:38,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-22 18:54:38,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 155. [2024-11-22 18:54:38,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 120 states have (on average 1.4833333333333334) internal successors, (178), 154 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:38,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 178 transitions. [2024-11-22 18:54:38,909 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 178 transitions. Word has length 18 [2024-11-22 18:54:38,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:54:38,910 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 178 transitions. [2024-11-22 18:54:38,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:38,910 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 178 transitions. [2024-11-22 18:54:38,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-22 18:54:38,910 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:54:38,910 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:54:38,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 18:54:38,911 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-22 18:54:38,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:54:38,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1253394517, now seen corresponding path program 1 times [2024-11-22 18:54:38,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:54:38,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550347579] [2024-11-22 18:54:38,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:54:38,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:54:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:54:39,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:54:39,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:54:39,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550347579] [2024-11-22 18:54:39,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550347579] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:54:39,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:54:39,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 18:54:39,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353765051] [2024-11-22 18:54:39,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:54:39,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 18:54:39,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:54:39,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 18:54:39,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:54:39,113 INFO L87 Difference]: Start difference. First operand 155 states and 178 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:39,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:54:39,401 INFO L93 Difference]: Finished difference Result 155 states and 177 transitions. [2024-11-22 18:54:39,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 18:54:39,401 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-22 18:54:39,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:54:39,402 INFO L225 Difference]: With dead ends: 155 [2024-11-22 18:54:39,402 INFO L226 Difference]: Without dead ends: 155 [2024-11-22 18:54:39,402 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-22 18:54:39,402 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 152 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:54:39,403 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 305 Invalid, 527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:54:39,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-22 18:54:39,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2024-11-22 18:54:39,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 120 states have (on average 1.475) internal successors, (177), 153 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:39,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 177 transitions. [2024-11-22 18:54:39,407 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 177 transitions. Word has length 20 [2024-11-22 18:54:39,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:54:39,407 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 177 transitions. [2024-11-22 18:54:39,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:39,407 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 177 transitions. [2024-11-22 18:54:39,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-22 18:54:39,407 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:54:39,408 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:54:39,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 18:54:39,408 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-22 18:54:39,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:54:39,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1253394518, now seen corresponding path program 1 times [2024-11-22 18:54:39,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:54:39,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094459838] [2024-11-22 18:54:39,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:54:39,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:54:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:54:39,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:54:39,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:54:39,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094459838] [2024-11-22 18:54:39,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094459838] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:54:39,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:54:39,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 18:54:39,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215566175] [2024-11-22 18:54:39,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:54:39,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 18:54:39,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:54:39,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 18:54:39,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-22 18:54:39,669 INFO L87 Difference]: Start difference. First operand 154 states and 177 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:40,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:54:40,072 INFO L93 Difference]: Finished difference Result 145 states and 167 transitions. [2024-11-22 18:54:40,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 18:54:40,072 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-22 18:54:40,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:54:40,073 INFO L225 Difference]: With dead ends: 145 [2024-11-22 18:54:40,073 INFO L226 Difference]: Without dead ends: 145 [2024-11-22 18:54:40,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2024-11-22 18:54:40,074 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 165 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:54:40,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 359 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 18:54:40,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-22 18:54:40,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 135. [2024-11-22 18:54:40,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 112 states have (on average 1.4017857142857142) internal successors, (157), 134 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:40,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 157 transitions. [2024-11-22 18:54:40,076 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 157 transitions. Word has length 20 [2024-11-22 18:54:40,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:54:40,077 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 157 transitions. [2024-11-22 18:54:40,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:40,077 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 157 transitions. [2024-11-22 18:54:40,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-22 18:54:40,077 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:54:40,077 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:54:40,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 18:54:40,078 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-22 18:54:40,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:54:40,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1737058081, now seen corresponding path program 1 times [2024-11-22 18:54:40,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:54:40,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367610039] [2024-11-22 18:54:40,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:54:40,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:54:40,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:54:40,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:54:40,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:54:40,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367610039] [2024-11-22 18:54:40,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367610039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:54:40,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:54:40,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:54:40,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971057212] [2024-11-22 18:54:40,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:54:40,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:54:40,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:54:40,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:54:40,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:54:40,125 INFO L87 Difference]: Start difference. First operand 135 states and 157 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:40,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:54:40,145 INFO L93 Difference]: Finished difference Result 141 states and 163 transitions. [2024-11-22 18:54:40,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:54:40,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-22 18:54:40,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:54:40,146 INFO L225 Difference]: With dead ends: 141 [2024-11-22 18:54:40,146 INFO L226 Difference]: Without dead ends: 141 [2024-11-22 18:54:40,146 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-11-22 18:54:40,146 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 1 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:54:40,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 318 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:54:40,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-22 18:54:40,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 139. [2024-11-22 18:54:40,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 116 states have (on average 1.3879310344827587) internal successors, (161), 138 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:40,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 161 transitions. [2024-11-22 18:54:40,149 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 161 transitions. Word has length 21 [2024-11-22 18:54:40,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:54:40,149 INFO L471 AbstractCegarLoop]: Abstraction has 139 states and 161 transitions. [2024-11-22 18:54:40,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:40,149 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 161 transitions. [2024-11-22 18:54:40,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-22 18:54:40,150 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:54:40,150 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:54:40,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 18:54:40,150 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-22 18:54:40,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:54:40,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1628462334, now seen corresponding path program 1 times [2024-11-22 18:54:40,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:54:40,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927101472] [2024-11-22 18:54:40,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:54:40,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:54:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:54:40,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:54:40,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:54:40,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927101472] [2024-11-22 18:54:40,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927101472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:54:40,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:54:40,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 18:54:40,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741160598] [2024-11-22 18:54:40,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:54:40,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:54:40,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:54:40,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:54:40,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:54:40,250 INFO L87 Difference]: Start difference. First operand 139 states and 161 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:40,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:54:40,467 INFO L93 Difference]: Finished difference Result 224 states and 256 transitions. [2024-11-22 18:54:40,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 18:54:40,467 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-22 18:54:40,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:54:40,468 INFO L225 Difference]: With dead ends: 224 [2024-11-22 18:54:40,468 INFO L226 Difference]: Without dead ends: 224 [2024-11-22 18:54:40,468 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2024-11-22 18:54:40,469 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 98 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:54:40,469 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 379 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:54:40,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-22 18:54:40,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 153. [2024-11-22 18:54:40,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 130 states have (on average 1.376923076923077) internal successors, (179), 152 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:40,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 179 transitions. [2024-11-22 18:54:40,473 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 179 transitions. Word has length 23 [2024-11-22 18:54:40,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:54:40,473 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 179 transitions. [2024-11-22 18:54:40,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:40,473 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 179 transitions. [2024-11-22 18:54:40,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-22 18:54:40,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:54:40,474 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:54:40,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 18:54:40,475 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-22 18:54:40,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:54:40,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1628462335, now seen corresponding path program 1 times [2024-11-22 18:54:40,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:54:40,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221125678] [2024-11-22 18:54:40,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:54:40,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:54:40,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:54:40,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:54:40,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:54:40,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221125678] [2024-11-22 18:54:40,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221125678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:54:40,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:54:40,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 18:54:40,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092162101] [2024-11-22 18:54:40,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:54:40,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:54:40,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:54:40,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:54:40,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:54:40,601 INFO L87 Difference]: Start difference. First operand 153 states and 179 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:40,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:54:40,811 INFO L93 Difference]: Finished difference Result 223 states and 254 transitions. [2024-11-22 18:54:40,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 18:54:40,812 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-22 18:54:40,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:54:40,813 INFO L225 Difference]: With dead ends: 223 [2024-11-22 18:54:40,813 INFO L226 Difference]: Without dead ends: 223 [2024-11-22 18:54:40,813 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-22 18:54:40,813 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 98 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:54:40,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 480 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:54:40,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-22 18:54:40,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 149. [2024-11-22 18:54:40,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 126 states have (on average 1.373015873015873) internal successors, (173), 148 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:40,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 173 transitions. [2024-11-22 18:54:40,817 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 173 transitions. Word has length 23 [2024-11-22 18:54:40,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:54:40,817 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 173 transitions. [2024-11-22 18:54:40,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:40,818 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2024-11-22 18:54:40,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-22 18:54:40,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:54:40,820 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:54:40,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 18:54:40,821 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-22 18:54:40,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:54:40,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1096320795, now seen corresponding path program 1 times [2024-11-22 18:54:40,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:54:40,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524565000] [2024-11-22 18:54:40,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:54:40,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:54:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:54:40,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:54:40,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:54:40,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524565000] [2024-11-22 18:54:40,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524565000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:54:40,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:54:40,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:54:40,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768860337] [2024-11-22 18:54:40,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:54:40,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 18:54:40,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:54:40,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 18:54:40,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:54:40,846 INFO L87 Difference]: Start difference. First operand 149 states and 173 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:40,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:54:40,852 INFO L93 Difference]: Finished difference Result 151 states and 175 transitions. [2024-11-22 18:54:40,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 18:54:40,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-22 18:54:40,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:54:40,853 INFO L225 Difference]: With dead ends: 151 [2024-11-22 18:54:40,853 INFO L226 Difference]: Without dead ends: 151 [2024-11-22 18:54:40,854 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 18:54:40,855 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 0 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:54:40,855 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 218 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:54:40,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2024-11-22 18:54:40,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2024-11-22 18:54:40,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 128 states have (on average 1.3671875) internal successors, (175), 150 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:40,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 175 transitions. [2024-11-22 18:54:40,866 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 175 transitions. Word has length 24 [2024-11-22 18:54:40,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:54:40,866 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 175 transitions. [2024-11-22 18:54:40,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:40,866 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 175 transitions. [2024-11-22 18:54:40,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-22 18:54:40,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:54:40,866 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:54:40,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 18:54:40,867 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-22 18:54:40,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:54:40,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1246771008, now seen corresponding path program 1 times [2024-11-22 18:54:40,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:54:40,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353849875] [2024-11-22 18:54:40,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:54:40,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:54:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:54:41,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:54:41,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:54:41,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353849875] [2024-11-22 18:54:41,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353849875] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:54:41,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:54:41,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 18:54:41,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707477187] [2024-11-22 18:54:41,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:54:41,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:54:41,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:54:41,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:54:41,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:54:41,011 INFO L87 Difference]: Start difference. First operand 151 states and 175 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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-11-22 18:54:41,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:54:41,212 INFO L93 Difference]: Finished difference Result 215 states and 245 transitions. [2024-11-22 18:54:41,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 18:54:41,213 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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 26 [2024-11-22 18:54:41,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:54:41,213 INFO L225 Difference]: With dead ends: 215 [2024-11-22 18:54:41,214 INFO L226 Difference]: Without dead ends: 215 [2024-11-22 18:54:41,214 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2024-11-22 18:54:41,214 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 205 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:54:41,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 389 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:54:41,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-22 18:54:41,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 157. [2024-11-22 18:54:41,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 134 states have (on average 1.3582089552238805) internal successors, (182), 156 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:41,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 182 transitions. [2024-11-22 18:54:41,217 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 182 transitions. Word has length 26 [2024-11-22 18:54:41,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:54:41,217 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 182 transitions. [2024-11-22 18:54:41,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 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-11-22 18:54:41,217 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 182 transitions. [2024-11-22 18:54:41,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 18:54:41,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:54:41,218 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:54:41,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-22 18:54:41,218 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-22 18:54:41,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:54:41,219 INFO L85 PathProgramCache]: Analyzing trace with hash 729704446, now seen corresponding path program 1 times [2024-11-22 18:54:41,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:54:41,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513838593] [2024-11-22 18:54:41,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:54:41,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:54:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:54:41,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:54:41,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:54:41,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513838593] [2024-11-22 18:54:41,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513838593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:54:41,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:54:41,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 18:54:41,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979976112] [2024-11-22 18:54:41,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:54:41,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 18:54:41,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:54:41,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 18:54:41,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:54:41,358 INFO L87 Difference]: Start difference. First operand 157 states and 182 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:41,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:54:41,691 INFO L93 Difference]: Finished difference Result 281 states and 319 transitions. [2024-11-22 18:54:41,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 18:54:41,691 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-22 18:54:41,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:54:41,692 INFO L225 Difference]: With dead ends: 281 [2024-11-22 18:54:41,692 INFO L226 Difference]: Without dead ends: 281 [2024-11-22 18:54:41,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=227, Unknown=0, NotChecked=0, Total=306 [2024-11-22 18:54:41,693 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 327 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:54:41,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 423 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:54:41,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2024-11-22 18:54:41,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 170. [2024-11-22 18:54:41,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 147 states have (on average 1.3537414965986394) internal successors, (199), 169 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:41,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 199 transitions. [2024-11-22 18:54:41,696 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 199 transitions. Word has length 27 [2024-11-22 18:54:41,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:54:41,696 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 199 transitions. [2024-11-22 18:54:41,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 9 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:41,696 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 199 transitions. [2024-11-22 18:54:41,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 18:54:41,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:54:41,697 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:54:41,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-22 18:54:41,697 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-22 18:54:41,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:54:41,699 INFO L85 PathProgramCache]: Analyzing trace with hash 729704447, now seen corresponding path program 1 times [2024-11-22 18:54:41,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:54:41,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49435112] [2024-11-22 18:54:41,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:54:41,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:54:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:54:41,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:54:41,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:54:41,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49435112] [2024-11-22 18:54:41,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49435112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:54:41,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:54:41,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-22 18:54:41,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811520022] [2024-11-22 18:54:41,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:54:41,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 18:54:41,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:54:41,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 18:54:41,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-22 18:54:41,977 INFO L87 Difference]: Start difference. First operand 170 states and 199 transitions. Second operand has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:42,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:54:42,476 INFO L93 Difference]: Finished difference Result 236 states and 270 transitions. [2024-11-22 18:54:42,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 18:54:42,477 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-22 18:54:42,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:54:42,478 INFO L225 Difference]: With dead ends: 236 [2024-11-22 18:54:42,478 INFO L226 Difference]: Without dead ends: 236 [2024-11-22 18:54:42,478 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2024-11-22 18:54:42,478 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 276 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 18:54:42,479 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 620 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 698 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 18:54:42,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2024-11-22 18:54:42,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 170. [2024-11-22 18:54:42,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 147 states have (on average 1.346938775510204) internal successors, (198), 169 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:42,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 198 transitions. [2024-11-22 18:54:42,481 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 198 transitions. Word has length 27 [2024-11-22 18:54:42,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:54:42,482 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 198 transitions. [2024-11-22 18:54:42,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:42,482 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 198 transitions. [2024-11-22 18:54:42,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 18:54:42,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:54:42,482 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:54:42,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-22 18:54:42,482 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-22 18:54:42,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:54:42,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1236719659, now seen corresponding path program 1 times [2024-11-22 18:54:42,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:54:42,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689018881] [2024-11-22 18:54:42,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:54:42,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:54:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:54:42,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:54:42,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:54:42,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689018881] [2024-11-22 18:54:42,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689018881] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:54:42,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:54:42,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:54:42,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448465806] [2024-11-22 18:54:42,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:54:42,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:54:42,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:54:42,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:54:42,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:54:42,510 INFO L87 Difference]: Start difference. First operand 170 states and 198 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:42,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:54:42,520 INFO L93 Difference]: Finished difference Result 174 states and 201 transitions. [2024-11-22 18:54:42,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 18:54:42,520 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-22 18:54:42,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:54:42,521 INFO L225 Difference]: With dead ends: 174 [2024-11-22 18:54:42,521 INFO L226 Difference]: Without dead ends: 174 [2024-11-22 18:54:42,521 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-11-22 18:54:42,522 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 0 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:54:42,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 321 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:54:42,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-22 18:54:42,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2024-11-22 18:54:42,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 151 states have (on average 1.3311258278145695) internal successors, (201), 173 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:42,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 201 transitions. [2024-11-22 18:54:42,524 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 201 transitions. Word has length 27 [2024-11-22 18:54:42,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:54:42,525 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 201 transitions. [2024-11-22 18:54:42,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:42,525 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 201 transitions. [2024-11-22 18:54:42,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-22 18:54:42,525 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:54:42,525 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:54:42,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-22 18:54:42,526 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-22 18:54:42,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:54:42,526 INFO L85 PathProgramCache]: Analyzing trace with hash 17756513, now seen corresponding path program 1 times [2024-11-22 18:54:42,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:54:42,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649267348] [2024-11-22 18:54:42,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:54:42,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:54:42,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:54:42,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:54:42,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:54:42,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649267348] [2024-11-22 18:54:42,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649267348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:54:42,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:54:42,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:54:42,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535785589] [2024-11-22 18:54:42,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:54:42,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:54:42,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:54:42,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:54:42,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:54:42,602 INFO L87 Difference]: Start difference. First operand 174 states and 201 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:42,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:54:42,711 INFO L93 Difference]: Finished difference Result 182 states and 210 transitions. [2024-11-22 18:54:42,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:54:42,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-22 18:54:42,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:54:42,712 INFO L225 Difference]: With dead ends: 182 [2024-11-22 18:54:42,712 INFO L226 Difference]: Without dead ends: 182 [2024-11-22 18:54:42,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:54:42,713 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 7 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:54:42,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 297 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:54:42,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2024-11-22 18:54:42,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 173. [2024-11-22 18:54:42,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 151 states have (on average 1.3245033112582782) internal successors, (200), 172 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:42,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 200 transitions. [2024-11-22 18:54:42,715 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 200 transitions. Word has length 28 [2024-11-22 18:54:42,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:54:42,716 INFO L471 AbstractCegarLoop]: Abstraction has 173 states and 200 transitions. [2024-11-22 18:54:42,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:42,716 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 200 transitions. [2024-11-22 18:54:42,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-22 18:54:42,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:54:42,716 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:54:42,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-22 18:54:42,716 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-22 18:54:42,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:54:42,717 INFO L85 PathProgramCache]: Analyzing trace with hash 17756514, now seen corresponding path program 1 times [2024-11-22 18:54:42,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:54:42,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879788560] [2024-11-22 18:54:42,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:54:42,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:54:42,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:54:42,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:54:42,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:54:42,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879788560] [2024-11-22 18:54:42,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879788560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:54:42,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:54:42,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 18:54:42,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121720480] [2024-11-22 18:54:42,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:54:42,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:54:42,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:54:42,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:54:42,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:54:42,853 INFO L87 Difference]: Start difference. First operand 173 states and 200 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:42,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:54:42,957 INFO L93 Difference]: Finished difference Result 172 states and 199 transitions. [2024-11-22 18:54:42,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:54:42,957 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2024-11-22 18:54:42,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:54:42,958 INFO L225 Difference]: With dead ends: 172 [2024-11-22 18:54:42,958 INFO L226 Difference]: Without dead ends: 172 [2024-11-22 18:54:42,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:54:42,959 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 1 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:54:42,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 286 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:54:42,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-22 18:54:42,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2024-11-22 18:54:42,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 151 states have (on average 1.3178807947019868) internal successors, (199), 171 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:42,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 199 transitions. [2024-11-22 18:54:42,961 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 199 transitions. Word has length 28 [2024-11-22 18:54:42,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:54:42,962 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 199 transitions. [2024-11-22 18:54:42,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:42,962 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 199 transitions. [2024-11-22 18:54:42,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-22 18:54:42,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:54:42,962 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:54:42,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-22 18:54:42,962 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-22 18:54:42,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:54:42,963 INFO L85 PathProgramCache]: Analyzing trace with hash 646841882, now seen corresponding path program 1 times [2024-11-22 18:54:42,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:54:42,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410091612] [2024-11-22 18:54:42,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:54:42,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:54:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:54:43,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:54:43,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:54:43,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410091612] [2024-11-22 18:54:43,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410091612] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:54:43,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831731658] [2024-11-22 18:54:43,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:54:43,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:54:43,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:54:43,164 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:54:43,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 18:54:43,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:54:43,251 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-22 18:54:43,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:54:43,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:54:43,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:54:43,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-22 18:54:43,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-22 18:54:43,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-22 18:54:43,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-22 18:54:43,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-22 18:54:43,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2024-11-22 18:54:43,567 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:54:43,568 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:54:43,866 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 10 treesize of output 8 [2024-11-22 18:54:43,871 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 14 treesize of output 12 [2024-11-22 18:54:43,881 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 10 treesize of output 8 [2024-11-22 18:54:43,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:54:43,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:54:43,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831731658] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:54:43,902 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:54:43,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 13 [2024-11-22 18:54:43,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325717520] [2024-11-22 18:54:43,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:54:43,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 18:54:43,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:54:43,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 18:54:43,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-22 18:54:43,903 INFO L87 Difference]: Start difference. First operand 172 states and 199 transitions. Second operand has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:44,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:54:44,334 INFO L93 Difference]: Finished difference Result 227 states and 257 transitions. [2024-11-22 18:54:44,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-22 18:54:44,336 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-22 18:54:44,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:54:44,337 INFO L225 Difference]: With dead ends: 227 [2024-11-22 18:54:44,337 INFO L226 Difference]: Without dead ends: 227 [2024-11-22 18:54:44,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=414, Unknown=0, NotChecked=0, Total=552 [2024-11-22 18:54:44,337 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 472 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:54:44,337 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 491 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 18:54:44,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-22 18:54:44,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 187. [2024-11-22 18:54:44,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 166 states have (on average 1.3012048192771084) internal successors, (216), 186 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:44,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 216 transitions. [2024-11-22 18:54:44,341 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 216 transitions. Word has length 29 [2024-11-22 18:54:44,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:54:44,341 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 216 transitions. [2024-11-22 18:54:44,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:44,342 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 216 transitions. [2024-11-22 18:54:44,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-22 18:54:44,342 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:54:44,342 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:54:44,352 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 18:54:44,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-22 18:54:44,546 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-22 18:54:44,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:54:44,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1316889152, now seen corresponding path program 1 times [2024-11-22 18:54:44,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:54:44,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918975533] [2024-11-22 18:54:44,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:54:44,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:54:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:54:44,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:54:44,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:54:44,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918975533] [2024-11-22 18:54:44,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918975533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:54:44,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:54:44,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-22 18:54:44,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197927993] [2024-11-22 18:54:44,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:54:44,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 18:54:44,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:54:44,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 18:54:44,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-22 18:54:44,763 INFO L87 Difference]: Start difference. First operand 187 states and 216 transitions. Second operand has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:45,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:54:45,122 INFO L93 Difference]: Finished difference Result 213 states and 240 transitions. [2024-11-22 18:54:45,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 18:54:45,122 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-22 18:54:45,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:54:45,123 INFO L225 Difference]: With dead ends: 213 [2024-11-22 18:54:45,123 INFO L226 Difference]: Without dead ends: 213 [2024-11-22 18:54:45,123 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2024-11-22 18:54:45,124 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 206 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:54:45,124 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 522 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 18:54:45,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-22 18:54:45,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 185. [2024-11-22 18:54:45,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 164 states have (on average 1.298780487804878) internal successors, (213), 184 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:45,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 213 transitions. [2024-11-22 18:54:45,126 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 213 transitions. Word has length 30 [2024-11-22 18:54:45,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:54:45,126 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 213 transitions. [2024-11-22 18:54:45,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.727272727272727) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:45,126 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 213 transitions. [2024-11-22 18:54:45,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-22 18:54:45,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:54:45,127 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:54:45,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-22 18:54:45,127 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-22 18:54:45,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:54:45,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1678128637, now seen corresponding path program 1 times [2024-11-22 18:54:45,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:54:45,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169235874] [2024-11-22 18:54:45,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:54:45,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:54:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:54:45,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:54:45,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:54:45,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169235874] [2024-11-22 18:54:45,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169235874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:54:45,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:54:45,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 18:54:45,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481390670] [2024-11-22 18:54:45,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:54:45,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 18:54:45,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:54:45,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 18:54:45,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:54:45,229 INFO L87 Difference]: Start difference. First operand 185 states and 213 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:45,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:54:45,436 INFO L93 Difference]: Finished difference Result 221 states and 252 transitions. [2024-11-22 18:54:45,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 18:54:45,436 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-22 18:54:45,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:54:45,437 INFO L225 Difference]: With dead ends: 221 [2024-11-22 18:54:45,437 INFO L226 Difference]: Without dead ends: 221 [2024-11-22 18:54:45,438 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-22 18:54:45,438 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 10 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:54:45,438 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 530 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:54:45,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-22 18:54:45,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 191. [2024-11-22 18:54:45,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 170 states have (on average 1.2941176470588236) internal successors, (220), 190 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:45,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 220 transitions. [2024-11-22 18:54:45,441 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 220 transitions. Word has length 32 [2024-11-22 18:54:45,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:54:45,441 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 220 transitions. [2024-11-22 18:54:45,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:45,441 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 220 transitions. [2024-11-22 18:54:45,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-22 18:54:45,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:54:45,441 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:54:45,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-22 18:54:45,442 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-22 18:54:45,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:54:45,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1575471623, now seen corresponding path program 1 times [2024-11-22 18:54:45,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:54:45,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820199604] [2024-11-22 18:54:45,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:54:45,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:54:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:54:45,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:54:45,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:54:45,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820199604] [2024-11-22 18:54:45,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820199604] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:54:45,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:54:45,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-22 18:54:45,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938659228] [2024-11-22 18:54:45,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:54:45,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 18:54:45,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:54:45,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 18:54:45,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-22 18:54:45,929 INFO L87 Difference]: Start difference. First operand 191 states and 220 transitions. Second operand has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:46,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:54:46,751 INFO L93 Difference]: Finished difference Result 217 states and 245 transitions. [2024-11-22 18:54:46,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-22 18:54:46,751 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2024-11-22 18:54:46,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:54:46,752 INFO L225 Difference]: With dead ends: 217 [2024-11-22 18:54:46,752 INFO L226 Difference]: Without dead ends: 217 [2024-11-22 18:54:46,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2024-11-22 18:54:46,752 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 168 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 18:54:46,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 660 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 18:54:46,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-22 18:54:46,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 188. [2024-11-22 18:54:46,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 167 states have (on average 1.2874251497005988) internal successors, (215), 187 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:46,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 215 transitions. [2024-11-22 18:54:46,755 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 215 transitions. Word has length 35 [2024-11-22 18:54:46,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:54:46,755 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 215 transitions. [2024-11-22 18:54:46,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6923076923076925) internal successors, (35), 13 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:46,755 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 215 transitions. [2024-11-22 18:54:46,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-22 18:54:46,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:54:46,756 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:54:46,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-22 18:54:46,756 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-22 18:54:46,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:54:46,756 INFO L85 PathProgramCache]: Analyzing trace with hash 2071072198, now seen corresponding path program 1 times [2024-11-22 18:54:46,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:54:46,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407795756] [2024-11-22 18:54:46,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:54:46,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:54:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:54:46,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:54:46,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:54:46,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407795756] [2024-11-22 18:54:46,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407795756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:54:46,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:54:46,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 18:54:46,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747046868] [2024-11-22 18:54:46,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:54:46,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 18:54:46,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:54:46,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 18:54:46,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 18:54:46,797 INFO L87 Difference]: Start difference. First operand 188 states and 215 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:46,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:54:46,883 INFO L93 Difference]: Finished difference Result 204 states and 225 transitions. [2024-11-22 18:54:46,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 18:54:46,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-22 18:54:46,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:54:46,884 INFO L225 Difference]: With dead ends: 204 [2024-11-22 18:54:46,884 INFO L226 Difference]: Without dead ends: 204 [2024-11-22 18:54:46,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 18:54:46,884 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 118 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:54:46,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 141 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:54:46,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-11-22 18:54:46,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 190. [2024-11-22 18:54:46,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 169 states have (on average 1.2840236686390532) internal successors, (217), 189 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:46,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 217 transitions. [2024-11-22 18:54:46,887 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 217 transitions. Word has length 36 [2024-11-22 18:54:46,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:54:46,888 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 217 transitions. [2024-11-22 18:54:46,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:46,888 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 217 transitions. [2024-11-22 18:54:46,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-22 18:54:46,888 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:54:46,888 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:54:46,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-22 18:54:46,888 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-22 18:54:46,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:54:46,889 INFO L85 PathProgramCache]: Analyzing trace with hash 2071061213, now seen corresponding path program 1 times [2024-11-22 18:54:46,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:54:46,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596207037] [2024-11-22 18:54:46,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:54:46,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:54:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:54:47,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:54:47,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:54:47,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596207037] [2024-11-22 18:54:47,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596207037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:54:47,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:54:47,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 18:54:47,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140663555] [2024-11-22 18:54:47,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:54:47,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:54:47,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:54:47,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:54:47,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:54:47,049 INFO L87 Difference]: Start difference. First operand 190 states and 217 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:47,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:54:47,241 INFO L93 Difference]: Finished difference Result 227 states and 257 transitions. [2024-11-22 18:54:47,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:54:47,241 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2024-11-22 18:54:47,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:54:47,242 INFO L225 Difference]: With dead ends: 227 [2024-11-22 18:54:47,242 INFO L226 Difference]: Without dead ends: 227 [2024-11-22 18:54:47,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-22 18:54:47,243 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 144 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:54:47,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 297 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:54:47,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2024-11-22 18:54:47,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 207. [2024-11-22 18:54:47,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 186 states have (on average 1.2634408602150538) internal successors, (235), 206 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:47,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 235 transitions. [2024-11-22 18:54:47,246 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 235 transitions. Word has length 36 [2024-11-22 18:54:47,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:54:47,246 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 235 transitions. [2024-11-22 18:54:47,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 7 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:47,246 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 235 transitions. [2024-11-22 18:54:47,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-22 18:54:47,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:54:47,246 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:54:47,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-22 18:54:47,247 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-22 18:54:47,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:54:47,247 INFO L85 PathProgramCache]: Analyzing trace with hash -221611581, now seen corresponding path program 1 times [2024-11-22 18:54:47,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:54:47,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574324995] [2024-11-22 18:54:47,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:54:47,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:54:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:54:47,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:54:47,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:54:47,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574324995] [2024-11-22 18:54:47,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574324995] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:54:47,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675624457] [2024-11-22 18:54:47,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:54:47,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:54:47,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:54:47,437 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:54:47,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 18:54:47,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:54:47,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-22 18:54:47,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:54:47,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:54:47,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-22 18:54:47,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:54:47,667 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:54:48,092 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 20 treesize of output 18 [2024-11-22 18:54:48,095 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 46 treesize of output 42 [2024-11-22 18:54:48,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:54:48,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675624457] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 18:54:48,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:54:48,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11, 8] total 22 [2024-11-22 18:54:48,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30465432] [2024-11-22 18:54:48,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:54:48,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 18:54:48,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:54:48,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 18:54:48,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2024-11-22 18:54:48,118 INFO L87 Difference]: Start difference. First operand 207 states and 235 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:48,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:54:48,344 INFO L93 Difference]: Finished difference Result 214 states and 242 transitions. [2024-11-22 18:54:48,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 18:54:48,345 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2024-11-22 18:54:48,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:54:48,346 INFO L225 Difference]: With dead ends: 214 [2024-11-22 18:54:48,346 INFO L226 Difference]: Without dead ends: 214 [2024-11-22 18:54:48,346 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2024-11-22 18:54:48,347 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 219 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:54:48,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 348 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 18:54:48,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2024-11-22 18:54:48,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 205. [2024-11-22 18:54:48,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 184 states have (on average 1.2608695652173914) internal successors, (232), 204 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:48,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 232 transitions. [2024-11-22 18:54:48,349 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 232 transitions. Word has length 37 [2024-11-22 18:54:48,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:54:48,349 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 232 transitions. [2024-11-22 18:54:48,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:48,350 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 232 transitions. [2024-11-22 18:54:48,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-22 18:54:48,350 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:54:48,350 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:54:48,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 18:54:48,554 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,SelfDestructingSolverStorable27 [2024-11-22 18:54:48,555 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-22 18:54:48,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:54:48,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1898858598, now seen corresponding path program 1 times [2024-11-22 18:54:48,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:54:48,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157408683] [2024-11-22 18:54:48,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:54:48,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:54:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:54:49,087 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:54:49,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:54:49,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157408683] [2024-11-22 18:54:49,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157408683] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:54:49,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899711844] [2024-11-22 18:54:49,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:54:49,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:54:49,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:54:49,091 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:54:49,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 18:54:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:54:49,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-22 18:54:49,204 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:54:49,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:54:49,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:54:49,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-22 18:54:49,312 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 18:54:49,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-22 18:54:49,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 18:54:49,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:54:49,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-22 18:54:49,373 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 15 treesize of output 1 [2024-11-22 18:54:49,426 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 15 treesize of output 7 [2024-11-22 18:54:49,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:54:49,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 32 [2024-11-22 18:54:49,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-22 18:54:49,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:54:49,554 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:54:49,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 14 [2024-11-22 18:54:49,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-22 18:54:49,634 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-22 18:54:49,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-22 18:54:49,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:54:49,736 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:54:49,851 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1037 (Array Int Int))) (not (= 2 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1037) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 12))))) is different from false [2024-11-22 18:54:50,159 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 8 treesize of output 4 [2024-11-22 18:54:52,378 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:54:52,379 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:54:52,390 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:54:52,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 42 [2024-11-22 18:54:52,394 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 39 treesize of output 27 [2024-11-22 18:54:52,398 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 8 treesize of output 4 [2024-11-22 18:54:52,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:54:52,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899711844] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:54:52,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:54:52,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 41 [2024-11-22 18:54:52,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800108246] [2024-11-22 18:54:52,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:54:52,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-22 18:54:52,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:54:52,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-22 18:54:52,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1384, Unknown=26, NotChecked=76, Total=1640 [2024-11-22 18:54:52,432 INFO L87 Difference]: Start difference. First operand 205 states and 232 transitions. Second operand has 41 states, 41 states have (on average 2.4634146341463414) internal successors, (101), 41 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:56,280 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 12))) (and (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (or (< |c_ULTIMATE.start_main_~head~0#1.offset| 4) (not (= .cse0 0))) (= .cse0 1) (forall ((v_ArrVal_1030 Int) (|v_ULTIMATE.start_main_#t~malloc7#1.base_10| Int) (v_ArrVal_1037 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_66| Int) (v_DerPreprocessor_2 Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_10|) 0)) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_66|) (not (= 2 (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base| (store (store (select |c_#memory_int#1| |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8) v_DerPreprocessor_2) |v_ULTIMATE.start_main_~x~0#1.offset_66| v_ArrVal_1030)) |v_ULTIMATE.start_main_#t~malloc7#1.base_10| v_ArrVal_1037) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))))) (forall ((v_ArrVal_1037 (Array Int Int))) (not (= 2 (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1037) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1)))))) is different from false [2024-11-22 18:54:56,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:54:56,767 INFO L93 Difference]: Finished difference Result 705 states and 782 transitions. [2024-11-22 18:54:56,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2024-11-22 18:54:56,768 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.4634146341463414) internal successors, (101), 41 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2024-11-22 18:54:56,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:54:56,769 INFO L225 Difference]: With dead ends: 705 [2024-11-22 18:54:56,769 INFO L226 Difference]: Without dead ends: 705 [2024-11-22 18:54:56,771 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2675 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=1536, Invalid=8474, Unknown=98, NotChecked=398, Total=10506 [2024-11-22 18:54:56,772 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 1138 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 2225 mSolverCounterSat, 277 mSolverCounterUnsat, 74 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 1837 SdHoareTripleChecker+Invalid, 3130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 2225 IncrementalHoareTripleChecker+Invalid, 74 IncrementalHoareTripleChecker+Unknown, 554 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-22 18:54:56,772 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 1837 Invalid, 3130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 2225 Invalid, 74 Unknown, 554 Unchecked, 1.6s Time] [2024-11-22 18:54:56,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 705 states. [2024-11-22 18:54:56,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 705 to 259. [2024-11-22 18:54:56,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 238 states have (on average 1.2352941176470589) internal successors, (294), 258 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:56,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 294 transitions. [2024-11-22 18:54:56,776 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 294 transitions. Word has length 38 [2024-11-22 18:54:56,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:54:56,776 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 294 transitions. [2024-11-22 18:54:56,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.4634146341463414) internal successors, (101), 41 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:56,777 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 294 transitions. [2024-11-22 18:54:56,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-22 18:54:56,777 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:54:56,777 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:54:56,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-22 18:54:56,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-22 18:54:56,982 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-22 18:54:56,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:54:56,982 INFO L85 PathProgramCache]: Analyzing trace with hash 2106907816, now seen corresponding path program 1 times [2024-11-22 18:54:56,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:54:56,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470266897] [2024-11-22 18:54:56,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:54:56,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:54:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:54:57,131 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:54:57,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:54:57,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470266897] [2024-11-22 18:54:57,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470266897] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:54:57,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166572218] [2024-11-22 18:54:57,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:54:57,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:54:57,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:54:57,134 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:54:57,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 18:54:57,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:54:57,223 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-22 18:54:57,225 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:54:57,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:54:57,445 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:54:57,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:54:57,631 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 38 treesize of output 41 [2024-11-22 18:54:57,640 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:54:57,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2024-11-22 18:54:57,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:54:57,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [166572218] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:54:57,846 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:54:57,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 20 [2024-11-22 18:54:57,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157112732] [2024-11-22 18:54:57,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:54:57,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-22 18:54:57,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:54:57,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-22 18:54:57,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2024-11-22 18:54:57,847 INFO L87 Difference]: Start difference. First operand 259 states and 294 transitions. Second operand has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:58,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:54:58,571 INFO L93 Difference]: Finished difference Result 324 states and 368 transitions. [2024-11-22 18:54:58,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-22 18:54:58,571 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 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 39 [2024-11-22 18:54:58,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:54:58,572 INFO L225 Difference]: With dead ends: 324 [2024-11-22 18:54:58,572 INFO L226 Difference]: Without dead ends: 324 [2024-11-22 18:54:58,572 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=163, Invalid=767, Unknown=0, NotChecked=0, Total=930 [2024-11-22 18:54:58,573 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 441 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 47 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 18:54:58,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 872 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 838 Invalid, 6 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 18:54:58,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2024-11-22 18:54:58,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 278. [2024-11-22 18:54:58,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 257 states have (on average 1.2412451361867705) internal successors, (319), 277 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:58,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 319 transitions. [2024-11-22 18:54:58,576 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 319 transitions. Word has length 39 [2024-11-22 18:54:58,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:54:58,576 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 319 transitions. [2024-11-22 18:54:58,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.4) internal successors, (88), 20 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:58,576 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 319 transitions. [2024-11-22 18:54:58,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-22 18:54:58,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:54:58,577 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:54:58,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-22 18:54:58,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:54:58,777 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-22 18:54:58,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:54:58,778 INFO L85 PathProgramCache]: Analyzing trace with hash 889632107, now seen corresponding path program 1 times [2024-11-22 18:54:58,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:54:58,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971978419] [2024-11-22 18:54:58,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:54:58,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:54:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:54:58,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:54:58,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:54:58,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971978419] [2024-11-22 18:54:58,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971978419] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:54:58,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600811260] [2024-11-22 18:54:58,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:54:58,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:54:58,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:54:58,875 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:54:58,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 18:54:58,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:54:58,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-22 18:54:58,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:54:59,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-22 18:54:59,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:54:59,026 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:54:59,069 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 18:54:59,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600811260] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:54:59,069 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:54:59,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-22 18:54:59,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548597667] [2024-11-22 18:54:59,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:54:59,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 18:54:59,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:54:59,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 18:54:59,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:54:59,070 INFO L87 Difference]: Start difference. First operand 278 states and 319 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:59,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:54:59,220 INFO L93 Difference]: Finished difference Result 284 states and 324 transitions. [2024-11-22 18:54:59,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:54:59,220 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2024-11-22 18:54:59,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:54:59,221 INFO L225 Difference]: With dead ends: 284 [2024-11-22 18:54:59,221 INFO L226 Difference]: Without dead ends: 256 [2024-11-22 18:54:59,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:54:59,222 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 20 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:54:59,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 303 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:54:59,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-22 18:54:59,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2024-11-22 18:54:59,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 235 states have (on average 1.2595744680851064) internal successors, (296), 255 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:59,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 296 transitions. [2024-11-22 18:54:59,225 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 296 transitions. Word has length 40 [2024-11-22 18:54:59,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:54:59,225 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 296 transitions. [2024-11-22 18:54:59,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:54:59,225 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 296 transitions. [2024-11-22 18:54:59,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-22 18:54:59,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:54:59,226 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:54:59,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-22 18:54:59,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:54:59,427 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-22 18:54:59,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:54:59,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1064649816, now seen corresponding path program 1 times [2024-11-22 18:54:59,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:54:59,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99304343] [2024-11-22 18:54:59,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:54:59,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:54:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:55:00,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:55:00,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:55:00,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99304343] [2024-11-22 18:55:00,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99304343] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:55:00,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183953897] [2024-11-22 18:55:00,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:55:00,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:55:00,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:55:00,177 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:55:00,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-22 18:55:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:55:00,285 INFO L255 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-22 18:55:00,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:55:00,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:55:00,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:55:00,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:55:00,396 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 18:55:00,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-22 18:55:00,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:55:00,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-22 18:55:00,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:55:00,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-22 18:55:00,522 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-22 18:55:00,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 43 [2024-11-22 18:55:00,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-22 18:55:00,647 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-22 18:55:00,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-22 18:55:00,661 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-22 18:55:00,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2024-11-22 18:55:00,726 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-22 18:55:00,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 22 [2024-11-22 18:55:00,741 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-22 18:55:00,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-22 18:55:00,779 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-22 18:55:00,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 43 [2024-11-22 18:55:00,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-22 18:55:00,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:55:00,951 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:55:00,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 11 [2024-11-22 18:55:00,958 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 7 treesize of output 3 [2024-11-22 18:55:00,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:55:00,962 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:55:01,061 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1277 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1277) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (forall ((v_ArrVal_1278 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1278) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2024-11-22 18:55:01,095 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1277 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1277) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.base|)) (forall ((v_ArrVal_1278 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1278) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))))) is different from false [2024-11-22 18:55:01,101 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1278 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1278) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (forall ((v_ArrVal_1277 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1277) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.base|)))) is different from false [2024-11-22 18:55:01,112 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1272 (Array Int Int)) (v_ArrVal_1271 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1271) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1272) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1278) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0))) (forall ((v_ArrVal_1277 (Array Int Int)) (v_ArrVal_1272 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1272))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1277)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) |c_ULTIMATE.start_main_~head~0#1.base|)))) is different from false [2024-11-22 18:55:04,073 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:55:04,078 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:55:04,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 54 [2024-11-22 18:55:04,082 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:55:04,087 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:55:04,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 41 [2024-11-22 18:55:04,091 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:55:04,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 49 [2024-11-22 18:55:04,094 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 114 treesize of output 96 [2024-11-22 18:55:04,098 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 28 treesize of output 24 [2024-11-22 18:55:04,101 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:55:04,103 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 12 treesize of output 8 [2024-11-22 18:55:04,107 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:55:04,108 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:55:04,110 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-11-22 18:55:04,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 1 [2024-11-22 18:55:04,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:55:04,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183953897] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:55:04,139 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:55:04,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 15] total 39 [2024-11-22 18:55:04,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299224630] [2024-11-22 18:55:04,139 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:55:04,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-22 18:55:04,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:55:04,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-22 18:55:04,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1009, Unknown=18, NotChecked=276, Total=1482 [2024-11-22 18:55:04,141 INFO L87 Difference]: Start difference. First operand 256 states and 296 transitions. Second operand has 39 states, 39 states have (on average 2.923076923076923) internal successors, (114), 39 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:55:08,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-22 18:55:12,307 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-11-22 18:55:16,386 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-11-22 18:55:20,388 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-11-22 18:55:25,186 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, 1] [2024-11-22 18:55:33,322 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, 1] [2024-11-22 18:55:37,352 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, 1] [2024-11-22 18:55:41,399 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, 1] [2024-11-22 18:55:45,427 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, 1] [2024-11-22 18:55:50,251 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_main_~x~0#1.offset|)) (.cse1 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((v_ArrVal_1278 (Array Int Int))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1278) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~x~0#1.base|) 8) 0) (= (select .cse2 8) |c_ULTIMATE.start_main_~x~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (forall ((v_ArrVal_1277 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1277) |c_ULTIMATE.start_main_~head~0#1.base|) .cse1) |c_ULTIMATE.start_main_~head~0#1.base|))))) is different from false [2024-11-22 18:55:59,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:55:59,477 INFO L93 Difference]: Finished difference Result 646 states and 732 transitions. [2024-11-22 18:55:59,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2024-11-22 18:55:59,478 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.923076923076923) internal successors, (114), 39 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-22 18:55:59,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:55:59,481 INFO L225 Difference]: With dead ends: 646 [2024-11-22 18:55:59,485 INFO L226 Difference]: Without dead ends: 646 [2024-11-22 18:55:59,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 20.8s TimeCoverageRelationStatistics Valid=788, Invalid=3621, Unknown=33, NotChecked=670, Total=5112 [2024-11-22 18:55:59,486 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 885 mSDsluCounter, 1776 mSDsCounter, 0 mSdLazyCounter, 1876 mSolverCounterSat, 150 mSolverCounterUnsat, 35 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 1870 SdHoareTripleChecker+Invalid, 4199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1876 IncrementalHoareTripleChecker+Invalid, 35 IncrementalHoareTripleChecker+Unknown, 2138 IncrementalHoareTripleChecker+Unchecked, 37.9s IncrementalHoareTripleChecker+Time [2024-11-22 18:55:59,486 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 1870 Invalid, 4199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1876 Invalid, 35 Unknown, 2138 Unchecked, 37.9s Time] [2024-11-22 18:55:59,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2024-11-22 18:55:59,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 265. [2024-11-22 18:55:59,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 244 states have (on average 1.2540983606557377) internal successors, (306), 264 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:55:59,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 306 transitions. [2024-11-22 18:55:59,496 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 306 transitions. Word has length 41 [2024-11-22 18:55:59,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:55:59,497 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 306 transitions. [2024-11-22 18:55:59,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.923076923076923) internal successors, (114), 39 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:55:59,497 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 306 transitions. [2024-11-22 18:55:59,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-22 18:55:59,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:55:59,501 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:55:59,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-22 18:55:59,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:55:59,702 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-22 18:55:59,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:55:59,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1774808160, now seen corresponding path program 1 times [2024-11-22 18:55:59,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:55:59,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204567737] [2024-11-22 18:55:59,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:55:59,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:55:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:56:00,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:56:00,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:56:00,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204567737] [2024-11-22 18:56:00,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204567737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:56:00,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:56:00,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 18:56:00,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290546891] [2024-11-22 18:56:00,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:56:00,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 18:56:00,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:56:00,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 18:56:00,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-22 18:56:00,018 INFO L87 Difference]: Start difference. First operand 265 states and 306 transitions. Second operand has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 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-11-22 18:56:00,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:56:00,432 INFO L93 Difference]: Finished difference Result 271 states and 311 transitions. [2024-11-22 18:56:00,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 18:56:00,432 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 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 42 [2024-11-22 18:56:00,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:56:00,433 INFO L225 Difference]: With dead ends: 271 [2024-11-22 18:56:00,433 INFO L226 Difference]: Without dead ends: 266 [2024-11-22 18:56:00,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-11-22 18:56:00,433 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 137 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:56:00,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 405 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 18:56:00,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-22 18:56:00,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 261. [2024-11-22 18:56:00,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 240 states have (on average 1.2541666666666667) internal successors, (301), 260 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 18:56:00,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 301 transitions. [2024-11-22 18:56:00,441 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 301 transitions. Word has length 42 [2024-11-22 18:56:00,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:56:00,441 INFO L471 AbstractCegarLoop]: Abstraction has 261 states and 301 transitions. [2024-11-22 18:56:00,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.2) internal successors, (42), 10 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-11-22 18:56:00,445 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 301 transitions. [2024-11-22 18:56:00,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-22 18:56:00,445 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:56:00,445 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:56:00,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-22 18:56:00,446 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2024-11-22 18:56:00,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:56:00,446 INFO L85 PathProgramCache]: Analyzing trace with hash 25746790, now seen corresponding path program 1 times [2024-11-22 18:56:00,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:56:00,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430761799] [2024-11-22 18:56:00,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:56:00,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:56:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:56:01,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:56:01,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:56:01,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430761799] [2024-11-22 18:56:01,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430761799] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:56:01,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2004333417] [2024-11-22 18:56:01,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:56:01,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:56:01,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:56:01,334 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:56:01,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-22 18:56:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:56:01,459 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-22 18:56:01,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:56:01,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:56:01,516 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-22 18:56:01,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-22 18:56:01,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 18:56:01,578 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-22 18:56:01,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-22 18:56:01,656 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-11-22 18:56:01,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2024-11-22 18:56:01,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:56:01,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 25 [2024-11-22 18:56:01,813 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-22 18:56:01,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 54 [2024-11-22 18:56:02,004 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-22 18:56:02,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 45 [2024-11-22 18:56:02,084 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-22 18:56:02,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 45 [2024-11-22 18:56:02,110 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-22 18:56:02,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 54 [2024-11-22 18:56:02,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:56:02,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 26 [2024-11-22 18:56:02,383 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 18:56:02,384 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:56:02,404 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1455 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1455) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2024-11-22 18:56:02,416 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1455 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem9#1.base| v_ArrVal_1455) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2024-11-22 18:56:02,419 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1455 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1455) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1)) is different from false [2024-11-22 18:56:02,526 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_20| Int) (v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_20|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_20| 1) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc7#1.base_20|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_20| v_ArrVal_1452))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1455)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1))) is different from false [2024-11-22 18:56:02,544 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc7#1.base_20| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_91| Int) (v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_20|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_20| 1) (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_91| |v_ULTIMATE.start_main_#t~malloc7#1.base_20|)) |v_ULTIMATE.start_main_#t~malloc7#1.base_20| v_ArrVal_1452))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_91|) v_ArrVal_1455)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_91|))) is different from false [2024-11-22 18:56:02,564 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1448 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc7#1.base_20| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_91| Int) (v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_20|) 0)) (< |c_ULTIMATE.start_main_~head~0#1.offset| |v_ULTIMATE.start_main_~x~0#1.offset_91|) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc7#1.base_20| 1) (select (select (let ((.cse0 (store (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1448))) (store .cse1 |c_ULTIMATE.start_main_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_91| |v_ULTIMATE.start_main_#t~malloc7#1.base_20|))) |v_ULTIMATE.start_main_#t~malloc7#1.base_20| v_ArrVal_1452))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_91|) v_ArrVal_1455)) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) 1))) is different from false [2024-11-22 18:56:02,627 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:56:02,631 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:56:02,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 52 [2024-11-22 18:56:02,636 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 58 treesize of output 54 [2024-11-22 18:56:02,639 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:56:02,641 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 51 treesize of output 43 [2024-11-22 18:56:02,644 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 18:56:02,647 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 35 treesize of output 31 [2024-11-22 18:56:02,650 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 16 treesize of output 12 [2024-11-22 18:56:06,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-22 18:56:06,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2004333417] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:56:06,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:56:06,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 40 [2024-11-22 18:56:06,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210053723] [2024-11-22 18:56:06,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:56:06,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2024-11-22 18:56:06,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:56:06,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2024-11-22 18:56:06,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1000, Unknown=7, NotChecked=426, Total=1640 [2024-11-22 18:56:06,823 INFO L87 Difference]: Start difference. First operand 261 states and 301 transitions. Second operand has 41 states, 40 states have (on average 2.65) internal successors, (106), 41 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)