./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memcleanup.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 338b6951ab628b0237aa41c64d1786e44f90130a76a8fd0978f750b3fe39d026 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:21:24,834 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:21:24,902 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-10-14 17:21:24,907 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:21:24,909 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:21:24,941 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:21:24,942 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:21:24,943 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:21:24,944 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 17:21:24,944 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 17:21:24,945 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:21:24,945 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:21:24,946 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:21:24,946 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:21:24,947 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:21:24,947 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:21:24,947 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:21:24,948 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:21:24,948 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:21:24,948 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:21:24,949 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:21:24,953 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:21:24,954 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-14 17:21:24,954 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-14 17:21:24,954 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:21:24,954 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:21:24,955 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 17:21:24,955 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:21:24,955 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:21:24,956 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:21:24,956 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:21:24,956 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:21:24,956 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:21:24,956 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:21:24,957 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 17:21:24,957 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:21:24,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:21:24,958 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:21:24,959 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:21:24,959 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:21:24,959 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:21:24,960 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:21:24,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:21:24,960 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:21:24,960 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:21:24,961 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-memcleanup) ) 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 -> 338b6951ab628b0237aa41c64d1786e44f90130a76a8fd0978f750b3fe39d026 [2024-10-14 17:21:25,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:21:25,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:21:25,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:21:25,300 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:21:25,300 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:21:25,302 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i [2024-10-14 17:21:26,659 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:21:26,947 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:21:26,948 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i [2024-10-14 17:21:26,975 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/222b918a6/bc88c269fe714dc490da30488449e347/FLAG1eff5a9c1 [2024-10-14 17:21:26,991 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/222b918a6/bc88c269fe714dc490da30488449e347 [2024-10-14 17:21:26,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:21:26,996 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:21:26,997 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:21:26,998 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:21:27,003 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:21:27,004 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:21:26" (1/1) ... [2024-10-14 17:21:27,007 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@633020bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:21:27, skipping insertion in model container [2024-10-14 17:21:27,007 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:21:26" (1/1) ... [2024-10-14 17:21:27,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:21:27,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:21:27,389 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:21:27,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:21:27,474 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:21:27,474 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:21:27 WrapperNode [2024-10-14 17:21:27,475 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:21:27,476 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:21:27,476 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:21:27,476 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:21:27,482 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:21:27" (1/1) ... [2024-10-14 17:21:27,496 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:21:27" (1/1) ... [2024-10-14 17:21:27,516 INFO L138 Inliner]: procedures = 119, calls = 52, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 224 [2024-10-14 17:21:27,516 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:21:27,517 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:21:27,517 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:21:27,517 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:21:27,526 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:21:27" (1/1) ... [2024-10-14 17:21:27,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:21:27" (1/1) ... [2024-10-14 17:21:27,530 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:21:27" (1/1) ... [2024-10-14 17:21:27,565 INFO L175 MemorySlicer]: Split 31 memory accesses to 2 slices as follows [2, 29]. 94 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 9 writes are split as follows [0, 9]. [2024-10-14 17:21:27,569 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:21:27" (1/1) ... [2024-10-14 17:21:27,570 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:21:27" (1/1) ... [2024-10-14 17:21:27,582 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:21:27" (1/1) ... [2024-10-14 17:21:27,591 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:21:27" (1/1) ... [2024-10-14 17:21:27,593 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:21:27" (1/1) ... [2024-10-14 17:21:27,595 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:21:27" (1/1) ... [2024-10-14 17:21:27,599 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:21:27,600 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:21:27,600 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:21:27,600 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:21:27,601 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:21:27" (1/1) ... [2024-10-14 17:21:27,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:21:27,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:21:27,633 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 17:21:27,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 17:21:27,689 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-10-14 17:21:27,689 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-10-14 17:21:27,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 17:21:27,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 17:21:27,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 17:21:27,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 17:21:27,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 17:21:27,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:21:27,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 17:21:27,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 17:21:27,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 17:21:27,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 17:21:27,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 17:21:27,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 17:21:27,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 17:21:27,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:21:27,691 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:21:27,846 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:21:27,848 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:21:28,120 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-14 17:21:28,120 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:21:28,153 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:21:28,154 INFO L314 CfgBuilder]: Removed 31 assume(true) statements. [2024-10-14 17:21:28,154 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:21:28 BoogieIcfgContainer [2024-10-14 17:21:28,155 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:21:28,158 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:21:28,158 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:21:28,161 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:21:28,161 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:21:26" (1/3) ... [2024-10-14 17:21:28,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c616950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:21:28, skipping insertion in model container [2024-10-14 17:21:28,162 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:21:27" (2/3) ... [2024-10-14 17:21:28,162 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c616950 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:21:28, skipping insertion in model container [2024-10-14 17:21:28,163 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:21:28" (3/3) ... [2024-10-14 17:21:28,164 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-queue-2.i [2024-10-14 17:21:28,182 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:21:28,182 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-10-14 17:21:28,226 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:21:28,233 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;@257e5b99, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:21:28,233 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-10-14 17:21:28,237 INFO L276 IsEmpty]: Start isEmpty. Operand has 89 states, 71 states have (on average 1.8309859154929577) internal successors, (130), 73 states have internal predecessors, (130), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 17:21:28,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-10-14 17:21:28,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:21:28,248 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-10-14 17:21:28,248 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:21:28,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:21:28,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1019578909, now seen corresponding path program 1 times [2024-10-14 17:21:28,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:21:28,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239545852] [2024-10-14 17:21:28,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:21:28,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:21:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:21:28,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:21:28,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:21:28,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239545852] [2024-10-14 17:21:28,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239545852] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:21:28,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:21:28,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:21:28,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761897945] [2024-10-14 17:21:28,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:21:28,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 17:21:28,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:21:28,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 17:21:28,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 17:21:28,498 INFO L87 Difference]: Start difference. First operand has 89 states, 71 states have (on average 1.8309859154929577) internal successors, (130), 73 states have internal predecessors, (130), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:28,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:21:28,528 INFO L93 Difference]: Finished difference Result 73 states and 96 transitions. [2024-10-14 17:21:28,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 17:21:28,530 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-10-14 17:21:28,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:21:28,535 INFO L225 Difference]: With dead ends: 73 [2024-10-14 17:21:28,535 INFO L226 Difference]: Without dead ends: 72 [2024-10-14 17:21:28,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 17:21:28,539 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:21:28,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 94 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:21:28,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-14 17:21:28,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-14 17:21:28,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 56 states have (on average 1.4464285714285714) internal successors, (81), 70 states have internal predecessors, (81), 14 states have call successors, (14), 1 states have call predecessors, (14), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:28,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 95 transitions. [2024-10-14 17:21:28,570 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 95 transitions. Word has length 6 [2024-10-14 17:21:28,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:21:28,571 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 95 transitions. [2024-10-14 17:21:28,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:28,571 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 95 transitions. [2024-10-14 17:21:28,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 17:21:28,572 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:21:28,572 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:21:28,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 17:21:28,572 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:21:28,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:21:28,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1057605461, now seen corresponding path program 1 times [2024-10-14 17:21:28,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:21:28,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701013483] [2024-10-14 17:21:28,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:21:28,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:21:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:21:28,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:21:28,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:21:28,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701013483] [2024-10-14 17:21:28,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701013483] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:21:28,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:21:28,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:21:28,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201504985] [2024-10-14 17:21:28,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:21:28,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:21:28,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:21:28,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:21:28,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:21:28,656 INFO L87 Difference]: Start difference. First operand 72 states and 95 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:28,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:21:28,714 INFO L93 Difference]: Finished difference Result 68 states and 86 transitions. [2024-10-14 17:21:28,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:21:28,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 17:21:28,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:21:28,716 INFO L225 Difference]: With dead ends: 68 [2024-10-14 17:21:28,717 INFO L226 Difference]: Without dead ends: 68 [2024-10-14 17:21:28,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:21:28,720 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 67 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:21:28,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 83 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:21:28,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-14 17:21:28,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-14 17:21:28,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 66 states have internal predecessors, (77), 9 states have call successors, (9), 1 states have call predecessors, (9), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:28,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 86 transitions. [2024-10-14 17:21:28,735 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 86 transitions. Word has length 7 [2024-10-14 17:21:28,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:21:28,736 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 86 transitions. [2024-10-14 17:21:28,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:28,736 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 86 transitions. [2024-10-14 17:21:28,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 17:21:28,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:21:28,737 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:21:28,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 17:21:28,738 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:21:28,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:21:28,740 INFO L85 PathProgramCache]: Analyzing trace with hash 921092451, now seen corresponding path program 1 times [2024-10-14 17:21:28,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:21:28,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440842603] [2024-10-14 17:21:28,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:21:28,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:21:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:21:29,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:21:29,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:21:29,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440842603] [2024-10-14 17:21:29,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440842603] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:21:29,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:21:29,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:21:29,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319765990] [2024-10-14 17:21:29,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:21:29,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:21:29,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:21:29,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:21:29,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:21:29,109 INFO L87 Difference]: Start difference. First operand 68 states and 86 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:29,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:21:29,238 INFO L93 Difference]: Finished difference Result 109 states and 137 transitions. [2024-10-14 17:21:29,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:21:29,238 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-14 17:21:29,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:21:29,239 INFO L225 Difference]: With dead ends: 109 [2024-10-14 17:21:29,239 INFO L226 Difference]: Without dead ends: 109 [2024-10-14 17:21:29,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:21:29,241 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 138 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:21:29,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 139 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:21:29,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-14 17:21:29,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 67. [2024-10-14 17:21:29,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 57 states have (on average 1.3333333333333333) internal successors, (76), 65 states have internal predecessors, (76), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:29,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 84 transitions. [2024-10-14 17:21:29,255 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 84 transitions. Word has length 10 [2024-10-14 17:21:29,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:21:29,256 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 84 transitions. [2024-10-14 17:21:29,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:29,256 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 84 transitions. [2024-10-14 17:21:29,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-14 17:21:29,257 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:21:29,257 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:21:29,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 17:21:29,259 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:21:29,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:21:29,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1528095303, now seen corresponding path program 1 times [2024-10-14 17:21:29,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:21:29,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402611704] [2024-10-14 17:21:29,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:21:29,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:21:29,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:21:29,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:21:29,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:21:29,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402611704] [2024-10-14 17:21:29,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402611704] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:21:29,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:21:29,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:21:29,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719689864] [2024-10-14 17:21:29,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:21:29,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:21:29,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:21:29,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:21:29,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:21:29,313 INFO L87 Difference]: Start difference. First operand 67 states and 84 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:29,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:21:29,357 INFO L93 Difference]: Finished difference Result 90 states and 112 transitions. [2024-10-14 17:21:29,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:21:29,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-10-14 17:21:29,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:21:29,358 INFO L225 Difference]: With dead ends: 90 [2024-10-14 17:21:29,359 INFO L226 Difference]: Without dead ends: 90 [2024-10-14 17:21:29,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:21:29,360 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 21 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:21:29,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 146 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:21:29,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-14 17:21:29,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 75. [2024-10-14 17:21:29,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 65 states have (on average 1.3076923076923077) internal successors, (85), 73 states have internal predecessors, (85), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:29,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 93 transitions. [2024-10-14 17:21:29,368 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 93 transitions. Word has length 13 [2024-10-14 17:21:29,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:21:29,369 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 93 transitions. [2024-10-14 17:21:29,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:29,369 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2024-10-14 17:21:29,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 17:21:29,370 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:21:29,371 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:21:29,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 17:21:29,371 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:21:29,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:21:29,372 INFO L85 PathProgramCache]: Analyzing trace with hash -737532340, now seen corresponding path program 1 times [2024-10-14 17:21:29,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:21:29,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343738012] [2024-10-14 17:21:29,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:21:29,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:21:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:21:29,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:21:29,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:21:29,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343738012] [2024-10-14 17:21:29,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343738012] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:21:29,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258074639] [2024-10-14 17:21:29,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:21:29,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:21:29,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:21:29,535 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:21:29,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 17:21:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:21:29,634 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 17:21:29,639 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:21:29,724 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 1 [2024-10-14 17:21:29,910 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 32 treesize of output 20 [2024-10-14 17:21:29,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-14 17:21:29,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:21:29,972 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:21:30,098 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-10-14 17:21:30,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:21:30,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258074639] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:21:30,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:21:30,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2024-10-14 17:21:30,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59697610] [2024-10-14 17:21:30,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:21:30,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 17:21:30,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:21:30,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 17:21:30,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2024-10-14 17:21:30,122 INFO L87 Difference]: Start difference. First operand 75 states and 93 transitions. Second operand has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:30,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:21:30,624 INFO L93 Difference]: Finished difference Result 130 states and 169 transitions. [2024-10-14 17:21:30,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-14 17:21:30,625 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 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 16 [2024-10-14 17:21:30,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:21:30,626 INFO L225 Difference]: With dead ends: 130 [2024-10-14 17:21:30,626 INFO L226 Difference]: Without dead ends: 130 [2024-10-14 17:21:30,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2024-10-14 17:21:30,628 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 315 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:21:30,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 551 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:21:30,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2024-10-14 17:21:30,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 79. [2024-10-14 17:21:30,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 69 states have (on average 1.318840579710145) internal successors, (91), 77 states have internal predecessors, (91), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:30,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 99 transitions. [2024-10-14 17:21:30,639 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 99 transitions. Word has length 16 [2024-10-14 17:21:30,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:21:30,640 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 99 transitions. [2024-10-14 17:21:30,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.4) internal successors, (36), 15 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:30,640 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 99 transitions. [2024-10-14 17:21:30,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-14 17:21:30,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:21:30,641 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:21:30,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 17:21:30,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:21:30,842 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:21:30,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:21:30,843 INFO L85 PathProgramCache]: Analyzing trace with hash -680274038, now seen corresponding path program 1 times [2024-10-14 17:21:30,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:21:30,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487200537] [2024-10-14 17:21:30,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:21:30,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:21:30,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:21:30,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:21:30,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:21:30,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487200537] [2024-10-14 17:21:30,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487200537] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:21:30,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467934520] [2024-10-14 17:21:30,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:21:30,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:21:30,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:21:30,943 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:21:30,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 17:21:31,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:21:31,024 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 17:21:31,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:21:31,057 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-10-14 17:21:31,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:21:31,088 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:21:31,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:21:31,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467934520] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:21:31,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:21:31,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 3 [2024-10-14 17:21:31,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252800817] [2024-10-14 17:21:31,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:21:31,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:21:31,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:21:31,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:21:31,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:21:31,118 INFO L87 Difference]: Start difference. First operand 79 states and 99 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:31,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:21:31,176 INFO L93 Difference]: Finished difference Result 98 states and 124 transitions. [2024-10-14 17:21:31,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:21:31,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-14 17:21:31,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:21:31,177 INFO L225 Difference]: With dead ends: 98 [2024-10-14 17:21:31,177 INFO L226 Difference]: Without dead ends: 96 [2024-10-14 17:21:31,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:21:31,178 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 9 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:21:31,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 294 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:21:31,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-14 17:21:31,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 80. [2024-10-14 17:21:31,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.3142857142857143) internal successors, (92), 78 states have internal predecessors, (92), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:31,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2024-10-14 17:21:31,183 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 16 [2024-10-14 17:21:31,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:21:31,183 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2024-10-14 17:21:31,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:31,184 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2024-10-14 17:21:31,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 17:21:31,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:21:31,185 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:21:31,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 17:21:31,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-14 17:21:31,389 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:21:31,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:21:31,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1388611957, now seen corresponding path program 2 times [2024-10-14 17:21:31,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:21:31,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555302544] [2024-10-14 17:21:31,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:21:31,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:21:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:21:31,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 17:21:31,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:21:31,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555302544] [2024-10-14 17:21:31,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555302544] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:21:31,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:21:31,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:21:31,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230553185] [2024-10-14 17:21:31,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:21:31,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:21:31,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:21:31,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:21:31,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:21:31,533 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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-10-14 17:21:31,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:21:31,611 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2024-10-14 17:21:31,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 17:21:31,612 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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 17 [2024-10-14 17:21:31,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:21:31,613 INFO L225 Difference]: With dead ends: 90 [2024-10-14 17:21:31,613 INFO L226 Difference]: Without dead ends: 90 [2024-10-14 17:21:31,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:21:31,614 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 13 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:21:31,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 282 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:21:31,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-10-14 17:21:31,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 83. [2024-10-14 17:21:31,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 73 states have (on average 1.2876712328767124) internal successors, (94), 81 states have internal predecessors, (94), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:31,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2024-10-14 17:21:31,619 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 102 transitions. Word has length 17 [2024-10-14 17:21:31,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:21:31,619 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 102 transitions. [2024-10-14 17:21:31,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 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-10-14 17:21:31,620 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2024-10-14 17:21:31,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 17:21:31,620 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:21:31,620 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:21:31,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 17:21:31,621 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:21:31,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:21:31,621 INFO L85 PathProgramCache]: Analyzing trace with hash 386395405, now seen corresponding path program 2 times [2024-10-14 17:21:31,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:21:31,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537290282] [2024-10-14 17:21:31,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:21:31,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:21:31,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:21:31,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:21:31,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:21:31,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537290282] [2024-10-14 17:21:31,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537290282] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:21:31,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855427925] [2024-10-14 17:21:31,732 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:21:31,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:21:31,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:21:31,734 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:21:31,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 17:21:31,823 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:21:31,823 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:21:31,826 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 17:21:31,829 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:21:31,841 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 33 treesize of output 7 [2024-10-14 17:21:31,849 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 7 [2024-10-14 17:21:31,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:21:31,910 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:21:31,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:21:31,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855427925] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:21:31,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:21:31,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 6 [2024-10-14 17:21:31,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89607962] [2024-10-14 17:21:31,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:21:31,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:21:31,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:21:31,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:21:31,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:21:31,975 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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-10-14 17:21:32,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:21:32,107 INFO L93 Difference]: Finished difference Result 96 states and 117 transitions. [2024-10-14 17:21:32,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 17:21:32,108 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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 17 [2024-10-14 17:21:32,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:21:32,108 INFO L225 Difference]: With dead ends: 96 [2024-10-14 17:21:32,108 INFO L226 Difference]: Without dead ends: 85 [2024-10-14 17:21:32,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-14 17:21:32,109 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 14 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:21:32,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 306 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:21:32,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-14 17:21:32,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 77. [2024-10-14 17:21:32,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 67 states have (on average 1.2985074626865671) internal successors, (87), 75 states have internal predecessors, (87), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:32,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 95 transitions. [2024-10-14 17:21:32,115 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 95 transitions. Word has length 17 [2024-10-14 17:21:32,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:21:32,115 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 95 transitions. [2024-10-14 17:21:32,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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-10-14 17:21:32,116 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 95 transitions. [2024-10-14 17:21:32,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-14 17:21:32,116 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:21:32,116 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:21:32,135 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-10-14 17:21:32,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:21:32,321 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:21:32,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:21:32,321 INFO L85 PathProgramCache]: Analyzing trace with hash -366619414, now seen corresponding path program 1 times [2024-10-14 17:21:32,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:21:32,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070117881] [2024-10-14 17:21:32,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:21:32,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:21:32,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:21:32,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:21:32,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:21:32,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070117881] [2024-10-14 17:21:32,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070117881] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:21:32,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [160789132] [2024-10-14 17:21:32,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:21:32,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:21:32,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:21:32,501 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:21:32,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 17:21:32,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:21:32,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-10-14 17:21:32,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:21:32,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 17:21:32,633 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 0 case distinctions, treesize of input 42 treesize of output 33 [2024-10-14 17:21:32,652 INFO L349 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2024-10-14 17:21:32,652 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 2 case distinctions, treesize of input 83 treesize of output 53 [2024-10-14 17:21:32,658 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 34 treesize of output 24 [2024-10-14 17:21:32,670 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 17:21:32,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 17:21:32,680 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 0 case distinctions, treesize of input 35 treesize of output 26 [2024-10-14 17:21:32,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:21:32,686 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 16 treesize of output 11 [2024-10-14 17:21:32,713 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 17:21:32,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-10-14 17:21:32,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2024-10-14 17:21:32,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:21:32,780 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:21:32,809 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_316 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_316) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2024-10-14 17:21:32,821 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:21:32,821 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 1 case distinctions, treesize of input 37 treesize of output 30 [2024-10-14 17:21:32,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:21:32,832 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 334 treesize of output 225 [2024-10-14 17:21:32,842 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 142 treesize of output 136 [2024-10-14 17:21:32,857 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:21:32,857 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 136 treesize of output 135 [2024-10-14 17:21:33,006 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:21:33,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [160789132] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:21:33,007 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:21:33,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2024-10-14 17:21:33,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988847155] [2024-10-14 17:21:33,007 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:21:33,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 17:21:33,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:21:33,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 17:21:33,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=52, Unknown=1, NotChecked=14, Total=90 [2024-10-14 17:21:33,009 INFO L87 Difference]: Start difference. First operand 77 states and 95 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:33,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:21:33,228 INFO L93 Difference]: Finished difference Result 145 states and 181 transitions. [2024-10-14 17:21:33,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:21:33,229 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-14 17:21:33,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:21:33,230 INFO L225 Difference]: With dead ends: 145 [2024-10-14 17:21:33,230 INFO L226 Difference]: Without dead ends: 145 [2024-10-14 17:21:33,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=63, Unknown=1, NotChecked=16, Total=110 [2024-10-14 17:21:33,231 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 71 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:21:33,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 528 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 221 Invalid, 0 Unknown, 109 Unchecked, 0.2s Time] [2024-10-14 17:21:33,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-10-14 17:21:33,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 90. [2024-10-14 17:21:33,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 80 states have (on average 1.275) internal successors, (102), 88 states have internal predecessors, (102), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:33,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 110 transitions. [2024-10-14 17:21:33,243 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 110 transitions. Word has length 20 [2024-10-14 17:21:33,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:21:33,244 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 110 transitions. [2024-10-14 17:21:33,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:33,247 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2024-10-14 17:21:33,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-14 17:21:33,248 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:21:33,248 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] [2024-10-14 17:21:33,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-14 17:21:33,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:21:33,449 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:21:33,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:21:33,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1889089916, now seen corresponding path program 1 times [2024-10-14 17:21:33,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:21:33,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413484084] [2024-10-14 17:21:33,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:21:33,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:21:33,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:21:33,489 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:21:33,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:21:33,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413484084] [2024-10-14 17:21:33,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413484084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:21:33,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:21:33,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:21:33,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649373264] [2024-10-14 17:21:33,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:21:33,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:21:33,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:21:33,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:21:33,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:21:33,492 INFO L87 Difference]: Start difference. First operand 90 states and 110 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:33,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:21:33,523 INFO L93 Difference]: Finished difference Result 125 states and 150 transitions. [2024-10-14 17:21:33,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:21:33,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-14 17:21:33,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:21:33,524 INFO L225 Difference]: With dead ends: 125 [2024-10-14 17:21:33,524 INFO L226 Difference]: Without dead ends: 125 [2024-10-14 17:21:33,524 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:21:33,525 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 28 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:21:33,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 141 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:21:33,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-14 17:21:33,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 103. [2024-10-14 17:21:33,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 93 states have (on average 1.2365591397849462) internal successors, (115), 101 states have internal predecessors, (115), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:33,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2024-10-14 17:21:33,530 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 21 [2024-10-14 17:21:33,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:21:33,530 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2024-10-14 17:21:33,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:33,531 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2024-10-14 17:21:33,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 17:21:33,531 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:21:33,532 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:21:33,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 17:21:33,532 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:21:33,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:21:33,533 INFO L85 PathProgramCache]: Analyzing trace with hash -402022758, now seen corresponding path program 1 times [2024-10-14 17:21:33,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:21:33,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187147572] [2024-10-14 17:21:33,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:21:33,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:21:33,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:21:33,598 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 17:21:33,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:21:33,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187147572] [2024-10-14 17:21:33,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187147572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:21:33,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:21:33,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:21:33,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433012879] [2024-10-14 17:21:33,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:21:33,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:21:33,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:21:33,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:21:33,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:21:33,602 INFO L87 Difference]: Start difference. First operand 103 states and 123 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:33,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:21:33,637 INFO L93 Difference]: Finished difference Result 139 states and 165 transitions. [2024-10-14 17:21:33,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:21:33,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-14 17:21:33,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:21:33,638 INFO L225 Difference]: With dead ends: 139 [2024-10-14 17:21:33,638 INFO L226 Difference]: Without dead ends: 139 [2024-10-14 17:21:33,639 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:21:33,639 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 33 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 17:21:33,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 164 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:21:33,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2024-10-14 17:21:33,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 116. [2024-10-14 17:21:33,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 106 states have (on average 1.2169811320754718) internal successors, (129), 114 states have internal predecessors, (129), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:33,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 137 transitions. [2024-10-14 17:21:33,649 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 137 transitions. Word has length 28 [2024-10-14 17:21:33,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:21:33,649 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 137 transitions. [2024-10-14 17:21:33,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:33,650 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 137 transitions. [2024-10-14 17:21:33,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 17:21:33,650 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:21:33,650 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] [2024-10-14 17:21:33,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 17:21:33,650 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:21:33,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:21:33,651 INFO L85 PathProgramCache]: Analyzing trace with hash 782121892, now seen corresponding path program 1 times [2024-10-14 17:21:33,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:21:33,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309658082] [2024-10-14 17:21:33,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:21:33,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:21:33,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:21:33,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 17:21:33,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:21:33,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309658082] [2024-10-14 17:21:33,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309658082] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:21:33,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889317617] [2024-10-14 17:21:33,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:21:33,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:21:33,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:21:33,756 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:21:33,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 17:21:33,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:21:33,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 17:21:33,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:21:33,889 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-10-14 17:21:33,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2024-10-14 17:21:33,916 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-14 17:21:33,916 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 17:21:33,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889317617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:21:33,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-14 17:21:33,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 7 [2024-10-14 17:21:33,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894391638] [2024-10-14 17:21:33,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:21:33,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:21:33,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:21:33,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:21:33,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 17:21:33,918 INFO L87 Difference]: Start difference. First operand 116 states and 137 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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-10-14 17:21:34,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:21:34,033 INFO L93 Difference]: Finished difference Result 144 states and 172 transitions. [2024-10-14 17:21:34,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 17:21:34,034 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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 28 [2024-10-14 17:21:34,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:21:34,035 INFO L225 Difference]: With dead ends: 144 [2024-10-14 17:21:34,035 INFO L226 Difference]: Without dead ends: 144 [2024-10-14 17:21:34,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-14 17:21:34,036 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 95 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:21:34,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 269 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 17:21:34,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-14 17:21:34,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 120. [2024-10-14 17:21:34,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 110 states have (on average 1.209090909090909) internal successors, (133), 118 states have internal predecessors, (133), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:34,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 141 transitions. [2024-10-14 17:21:34,039 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 141 transitions. Word has length 28 [2024-10-14 17:21:34,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:21:34,040 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 141 transitions. [2024-10-14 17:21:34,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 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-10-14 17:21:34,040 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 141 transitions. [2024-10-14 17:21:34,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 17:21:34,040 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:21:34,041 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:21:34,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 17:21:34,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-14 17:21:34,245 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:21:34,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:21:34,245 INFO L85 PathProgramCache]: Analyzing trace with hash 791586252, now seen corresponding path program 1 times [2024-10-14 17:21:34,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:21:34,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451528282] [2024-10-14 17:21:34,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:21:34,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:21:34,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:21:34,832 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:21:34,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:21:34,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451528282] [2024-10-14 17:21:34,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451528282] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:21:34,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370911018] [2024-10-14 17:21:34,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:21:34,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:21:34,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:21:34,835 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:21:34,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 17:21:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:21:34,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-14 17:21:34,972 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:21:34,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 17:21:35,000 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 0 case distinctions, treesize of input 42 treesize of output 33 [2024-10-14 17:21:35,012 INFO L349 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2024-10-14 17:21:35,012 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 2 case distinctions, treesize of input 93 treesize of output 61 [2024-10-14 17:21:35,020 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 42 treesize of output 30 [2024-10-14 17:21:35,025 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 0 case distinctions, treesize of input 35 treesize of output 26 [2024-10-14 17:21:35,039 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 17:21:35,039 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 1 case distinctions, treesize of input 38 treesize of output 35 [2024-10-14 17:21:35,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 17:21:35,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 17:21:35,069 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-14 17:21:35,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 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-10-14 17:21:35,102 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 16 treesize of output 11 [2024-10-14 17:21:35,172 INFO L349 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2024-10-14 17:21:35,173 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 49 [2024-10-14 17:21:35,185 INFO L349 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2024-10-14 17:21:35,186 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 47 [2024-10-14 17:21:35,201 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-10-14 17:21:35,202 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 49 [2024-10-14 17:21:35,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:21:35,217 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-10-14 17:21:35,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 79 treesize of output 64 [2024-10-14 17:21:35,235 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-10-14 17:21:35,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-10-14 17:21:35,295 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-10-14 17:21:35,295 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 56 [2024-10-14 17:21:35,449 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-10-14 17:21:35,449 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 23 [2024-10-14 17:21:35,455 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:21:35,455 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:21:35,481 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_658 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_658) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2024-10-14 17:21:35,498 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_25| Int) (v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_25|) 0)) (not (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset| |v_ULTIMATE.start_main_#t~malloc3#1.base_25|)) |v_ULTIMATE.start_main_#t~malloc3#1.base_25| v_ArrVal_657))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_658)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)))) is different from false [2024-10-14 17:21:35,566 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:21:35,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2024-10-14 17:21:35,577 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_8 (Array Int Int)) (v_ArrVal_658 (Array Int Int)) (v_ArrVal_657 (Array Int Int)) (|ULTIMATE.start_main_~item~0#1.offset| Int)) (let ((.cse1 (select v_arrayElimArr_8 |ULTIMATE.start_main_~item~0#1.offset|))) (or (not (= (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_arrayElimArr_8) .cse1 v_ArrVal_657))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_658)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= (select |c_#valid| .cse1) 0))))) is different from false [2024-10-14 17:21:35,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:21:35,593 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 1 case distinctions, treesize of input 98 treesize of output 67 [2024-10-14 17:21:35,608 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:21:35,608 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 4267 treesize of output 3186 [2024-10-14 17:21:35,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:21:35,698 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 1330 treesize of output 1140 [2024-10-14 17:21:35,722 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 1122 treesize of output 1086 [2024-10-14 17:21:35,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:21:35,756 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 1086 treesize of output 1063 [2024-10-14 17:21:35,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:21:35,813 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 1054 treesize of output 979 [2024-10-14 17:21:36,761 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2024-10-14 17:21:36,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370911018] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:21:36,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:21:36,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 16 [2024-10-14 17:21:36,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013741023] [2024-10-14 17:21:36,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:21:36,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-14 17:21:36,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:21:36,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-14 17:21:36,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=148, Unknown=3, NotChecked=78, Total=272 [2024-10-14 17:21:36,764 INFO L87 Difference]: Start difference. First operand 120 states and 141 transitions. Second operand has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 16 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:40,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 17:21:44,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-10-14 17:21:45,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:21:45,252 INFO L93 Difference]: Finished difference Result 191 states and 229 transitions. [2024-10-14 17:21:45,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 17:21:45,253 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 16 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-14 17:21:45,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:21:45,253 INFO L225 Difference]: With dead ends: 191 [2024-10-14 17:21:45,253 INFO L226 Difference]: Without dead ends: 191 [2024-10-14 17:21:45,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=84, Invalid=267, Unknown=3, NotChecked=108, Total=462 [2024-10-14 17:21:45,254 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 143 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 10 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 368 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2024-10-14 17:21:45,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 897 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 414 Invalid, 3 Unknown, 368 Unchecked, 8.4s Time] [2024-10-14 17:21:45,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-14 17:21:45,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 136. [2024-10-14 17:21:45,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 126 states have (on average 1.1904761904761905) internal successors, (150), 134 states have internal predecessors, (150), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:45,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 158 transitions. [2024-10-14 17:21:45,261 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 158 transitions. Word has length 29 [2024-10-14 17:21:45,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:21:45,261 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 158 transitions. [2024-10-14 17:21:45,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 16 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:45,261 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 158 transitions. [2024-10-14 17:21:45,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 17:21:45,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:21:45,264 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:21:45,281 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 17:21:45,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:21:45,465 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:21:45,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:21:45,465 INFO L85 PathProgramCache]: Analyzing trace with hash 995988913, now seen corresponding path program 1 times [2024-10-14 17:21:45,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:21:45,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416569335] [2024-10-14 17:21:45,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:21:45,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:21:45,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:21:45,868 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:21:45,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:21:45,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416569335] [2024-10-14 17:21:45,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416569335] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:21:45,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426013244] [2024-10-14 17:21:45,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:21:45,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:21:45,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:21:45,871 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:21:45,872 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 17:21:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:21:45,993 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-14 17:21:45,995 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:21:46,020 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 0 case distinctions, treesize of input 35 treesize of output 26 [2024-10-14 17:21:46,032 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 17:21:46,032 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 38 treesize of output 35 [2024-10-14 17:21:46,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 17:21:46,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 17:21:46,065 INFO L349 Elim1Store]: treesize reduction 34, result has 30.6 percent of original size [2024-10-14 17:21:46,065 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 39 [2024-10-14 17:21:46,082 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 0 case distinctions, treesize of input 42 treesize of output 33 [2024-10-14 17:21:46,098 INFO L349 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2024-10-14 17:21:46,098 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 2 case distinctions, treesize of input 91 treesize of output 59 [2024-10-14 17:21:46,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 40 treesize of output 28 [2024-10-14 17:21:46,149 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 17:21:46,149 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 38 treesize of output 37 [2024-10-14 17:21:46,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2024-10-14 17:21:46,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 21 treesize of output 32 [2024-10-14 17:21:46,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 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 21 treesize of output 37 [2024-10-14 17:21:46,391 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:21:46,391 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:21:46,444 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_753 (Array Int Int))) (= (store (store |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base| 0) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_753) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-10-14 17:21:46,453 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:21:46,453 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 49 treesize of output 42 [2024-10-14 17:21:46,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:21:46,465 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 454 treesize of output 317 [2024-10-14 17:21:46,472 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 259 treesize of output 251 [2024-10-14 17:21:46,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:21:46,484 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 251 treesize of output 247 [2024-10-14 17:21:48,481 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:21:48,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426013244] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:21:48,482 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:21:48,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2024-10-14 17:21:48,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356654876] [2024-10-14 17:21:48,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:21:48,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 17:21:48,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:21:48,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 17:21:48,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=121, Unknown=1, NotChecked=22, Total=182 [2024-10-14 17:21:48,483 INFO L87 Difference]: Start difference. First operand 136 states and 158 transitions. Second operand has 14 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:49,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:21:49,632 INFO L93 Difference]: Finished difference Result 165 states and 194 transitions. [2024-10-14 17:21:49,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 17:21:49,633 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-14 17:21:49,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:21:49,634 INFO L225 Difference]: With dead ends: 165 [2024-10-14 17:21:49,634 INFO L226 Difference]: Without dead ends: 163 [2024-10-14 17:21:49,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=47, Invalid=138, Unknown=1, NotChecked=24, Total=210 [2024-10-14 17:21:49,635 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 37 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-14 17:21:49,635 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 605 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 218 Invalid, 0 Unknown, 76 Unchecked, 1.1s Time] [2024-10-14 17:21:49,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-10-14 17:21:49,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 152. [2024-10-14 17:21:49,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 142 states have (on average 1.1971830985915493) internal successors, (170), 150 states have internal predecessors, (170), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:49,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 178 transitions. [2024-10-14 17:21:49,642 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 178 transitions. Word has length 29 [2024-10-14 17:21:49,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:21:49,642 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 178 transitions. [2024-10-14 17:21:49,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 6.230769230769231) internal successors, (81), 13 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:49,642 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 178 transitions. [2024-10-14 17:21:49,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-14 17:21:49,643 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:21:49,643 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] [2024-10-14 17:21:49,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-14 17:21:49,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:21:49,844 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:21:49,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:21:49,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1612788679, now seen corresponding path program 1 times [2024-10-14 17:21:49,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:21:49,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959380671] [2024-10-14 17:21:49,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:21:49,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:21:49,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:21:49,882 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-14 17:21:49,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:21:49,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959380671] [2024-10-14 17:21:49,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959380671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:21:49,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:21:49,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:21:49,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086530962] [2024-10-14 17:21:49,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:21:49,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:21:49,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:21:49,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:21:49,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:21:49,886 INFO L87 Difference]: Start difference. First operand 152 states and 178 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:49,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:21:49,902 INFO L93 Difference]: Finished difference Result 154 states and 180 transitions. [2024-10-14 17:21:49,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:21:49,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-10-14 17:21:49,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:21:49,904 INFO L225 Difference]: With dead ends: 154 [2024-10-14 17:21:49,904 INFO L226 Difference]: Without dead ends: 154 [2024-10-14 17:21:49,905 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:21:49,907 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 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-10-14 17:21:49,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 17:21:49,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-10-14 17:21:49,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-10-14 17:21:49,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 144 states have (on average 1.1944444444444444) internal successors, (172), 152 states have internal predecessors, (172), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:49,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 180 transitions. [2024-10-14 17:21:49,912 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 180 transitions. Word has length 30 [2024-10-14 17:21:49,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:21:49,913 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 180 transitions. [2024-10-14 17:21:49,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:49,913 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 180 transitions. [2024-10-14 17:21:49,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-14 17:21:49,913 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:21:49,914 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] [2024-10-14 17:21:49,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 17:21:49,914 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:21:49,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:21:49,914 INFO L85 PathProgramCache]: Analyzing trace with hash 1614635721, now seen corresponding path program 1 times [2024-10-14 17:21:49,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:21:49,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937931134] [2024-10-14 17:21:49,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:21:49,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:21:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:21:50,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:21:50,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:21:50,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937931134] [2024-10-14 17:21:50,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937931134] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:21:50,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130743419] [2024-10-14 17:21:50,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:21:50,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:21:50,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:21:50,446 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:21:50,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-14 17:21:50,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:21:50,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-14 17:21:50,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:21:50,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 17:21:50,613 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 0 case distinctions, treesize of input 35 treesize of output 26 [2024-10-14 17:21:50,628 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-14 17:21:50,628 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 30 [2024-10-14 17:21:50,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-10-14 17:21:50,653 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 17:21:50,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 17:21:50,659 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 0 case distinctions, treesize of input 35 treesize of output 26 [2024-10-14 17:21:50,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:21:50,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-14 17:21:50,670 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-10-14 17:21:50,698 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-14 17:21:50,698 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 97 treesize of output 86 [2024-10-14 17:21:50,702 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 73 treesize of output 56 [2024-10-14 17:21:50,707 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 39 treesize of output 1 [2024-10-14 17:21:50,799 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 33 treesize of output 21 [2024-10-14 17:21:50,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 21 treesize of output 13 [2024-10-14 17:21:50,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2024-10-14 17:21:50,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:21:50,834 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:21:50,910 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 72 treesize of output 52 [2024-10-14 17:21:50,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:21:50,966 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 103 treesize of output 96 [2024-10-14 17:21:50,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:21:50,973 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 87 treesize of output 64 [2024-10-14 17:21:50,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:21:50,984 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 371 treesize of output 242 [2024-10-14 17:21:51,003 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:21:51,004 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 331 treesize of output 303 [2024-10-14 17:21:51,014 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 201 treesize of output 195 [2024-10-14 17:21:51,027 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:21:51,027 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 195 treesize of output 194 [2024-10-14 17:21:51,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:21:51,051 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 185 treesize of output 168 [2024-10-14 17:21:51,058 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 159 treesize of output 153 [2024-10-14 17:21:51,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:21:51,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130743419] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:21:51,253 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:21:51,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2024-10-14 17:21:51,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089420525] [2024-10-14 17:21:51,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:21:51,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 17:21:51,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:21:51,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 17:21:51,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=198, Unknown=3, NotChecked=0, Total=240 [2024-10-14 17:21:51,255 INFO L87 Difference]: Start difference. First operand 154 states and 180 transitions. Second operand has 16 states, 16 states have (on average 4.75) internal successors, (76), 15 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:51,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 17:21:51,670 INFO L93 Difference]: Finished difference Result 219 states and 258 transitions. [2024-10-14 17:21:51,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 17:21:51,671 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.75) internal successors, (76), 15 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-10-14 17:21:51,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 17:21:51,673 INFO L225 Difference]: With dead ends: 219 [2024-10-14 17:21:51,674 INFO L226 Difference]: Without dead ends: 219 [2024-10-14 17:21:51,674 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=110, Invalid=393, Unknown=3, NotChecked=0, Total=506 [2024-10-14 17:21:51,675 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 246 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 17:21:51,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 668 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 17:21:51,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-10-14 17:21:51,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 157. [2024-10-14 17:21:51,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 147 states have (on average 1.2040816326530612) internal successors, (177), 155 states have internal predecessors, (177), 8 states have call successors, (8), 1 states have call predecessors, (8), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:51,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 185 transitions. [2024-10-14 17:21:51,679 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 185 transitions. Word has length 30 [2024-10-14 17:21:51,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 17:21:51,679 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 185 transitions. [2024-10-14 17:21:51,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.75) internal successors, (76), 15 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:21:51,679 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 185 transitions. [2024-10-14 17:21:51,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-14 17:21:51,680 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 17:21:51,680 INFO L215 NwaCegarLoop]: trace histogram [3, 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-10-14 17:21:51,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-14 17:21:51,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-14 17:21:51,885 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-10-14 17:21:51,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:21:51,885 INFO L85 PathProgramCache]: Analyzing trace with hash 810939334, now seen corresponding path program 2 times [2024-10-14 17:21:51,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:21:51,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188227518] [2024-10-14 17:21:51,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:21:51,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:21:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:21:52,322 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:21:52,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:21:52,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188227518] [2024-10-14 17:21:52,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188227518] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:21:52,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146704303] [2024-10-14 17:21:52,323 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 17:21:52,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:21:52,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:21:52,325 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:21:52,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-14 17:21:52,459 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 17:21:52,459 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 17:21:52,461 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-14 17:21:52,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:21:52,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-14 17:21:52,512 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 0 case distinctions, treesize of input 36 treesize of output 27 [2024-10-14 17:21:52,524 INFO L349 Elim1Store]: treesize reduction 14, result has 39.1 percent of original size [2024-10-14 17:21:52,525 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 39 treesize of output 43 [2024-10-14 17:21:52,544 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-14 17:21:52,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 35 [2024-10-14 17:21:52,565 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-14 17:21:52,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-10-14 17:21:52,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:21:52,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 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 49 treesize of output 52 [2024-10-14 17:21:52,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:21:52,588 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 21 treesize of output 5 [2024-10-14 17:21:52,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-10-14 17:21:52,604 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-10-14 17:21:52,683 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-14 17:21:52,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 68 [2024-10-14 17:21:52,705 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 25 [2024-10-14 17:21:53,040 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:21:53,040 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:21:53,146 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_main_~item~0#1.offset| 8))) (and (forall ((v_ArrVal_994 (Array Int Int))) (or (forall ((v_ArrVal_993 (Array Int Int))) (or (= (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_993))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_994) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0) (not (= v_ArrVal_993 (store .cse1 .cse2 (select v_ArrVal_993 .cse2)))))) (not (= v_ArrVal_994 (store .cse3 .cse2 (select v_ArrVal_994 .cse2)))))) (forall ((v_ArrVal_994 (Array Int Int))) (or (forall ((v_ArrVal_993 (Array Int Int))) (or (not (= v_ArrVal_993 (store .cse1 .cse2 (select v_ArrVal_993 .cse2)))) (= (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_994))) (select (select .cse4 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_993) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (select .cse4 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 0))) (not (= v_ArrVal_994 (store .cse3 .cse2 (select v_ArrVal_994 .cse2)))))))) is different from false [2024-10-14 17:21:53,175 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:21:53,176 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 589 treesize of output 462 [2024-10-14 17:21:53,233 INFO L349 Elim1Store]: treesize reduction 25, result has 50.0 percent of original size [2024-10-14 17:21:53,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 453 treesize of output 340 [2024-10-14 17:21:54,279 INFO L349 Elim1Store]: treesize reduction 86, result has 76.7 percent of original size [2024-10-14 17:21:54,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 11 new quantified variables, introduced 36 case distinctions, treesize of input 13868 treesize of output 13174 [2024-10-14 17:21:54,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-14 17:21:55,361 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:21:55,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 22681 treesize of output 21797 [2024-10-14 17:21:57,128 INFO L349 Elim1Store]: treesize reduction 832, result has 28.5 percent of original size [2024-10-14 17:21:57,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 12 new quantified variables, introduced 38 case distinctions, treesize of input 7162 treesize of output 7275 [2024-10-14 17:21:58,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-14 17:21:58,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 7059 treesize of output 6593