./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/dll-queue-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-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-?-c7c6ca5-m [2024-11-09 07:11:38,629 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:11:38,692 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-09 07:11:38,696 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:11:38,697 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:11:38,730 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:11:38,730 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:11:38,731 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:11:38,731 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:11:38,732 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:11:38,732 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:11:38,733 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:11:38,734 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:11:38,737 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:11:38,740 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:11:38,740 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:11:38,741 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 07:11:38,741 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:11:38,741 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:11:38,741 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:11:38,742 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:11:38,742 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 07:11:38,743 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:11:38,743 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:11:38,743 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:11:38,743 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 07:11:38,743 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:11:38,744 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:11:38,744 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:11:38,744 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:11:38,744 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 07:11:38,745 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:11:38,745 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:11:38,745 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:11:38,745 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:11:38,746 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:11:38,746 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:11:38,750 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:11:38,750 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:11:38,750 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:11:38,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:11:38,751 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:11:38,752 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:11:38,752 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:11:38,752 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:11:38,753 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-11-09 07:11:39,031 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:11:39,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:11:39,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:11:39,061 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:11:39,061 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:11:39,063 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-queue-2.i [2024-11-09 07:11:40,542 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:11:40,783 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:11:40,784 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i [2024-11-09 07:11:40,796 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ce6c9b7b/f07b4a756e6e4e979b5ba0e0508f54a2/FLAG163de3ffb [2024-11-09 07:11:40,807 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ce6c9b7b/f07b4a756e6e4e979b5ba0e0508f54a2 [2024-11-09 07:11:40,809 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:11:40,811 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:11:40,812 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:11:40,812 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:11:40,817 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:11:40,818 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:11:40" (1/1) ... [2024-11-09 07:11:40,818 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e561e52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:40, skipping insertion in model container [2024-11-09 07:11:40,819 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:11:40" (1/1) ... [2024-11-09 07:11:40,857 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:11:41,211 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:11:41,220 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:11:41,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:11:41,313 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:11:41,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:41 WrapperNode [2024-11-09 07:11:41,314 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:11:41,315 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:11:41,315 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:11:41,315 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:11:41,322 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:41" (1/1) ... [2024-11-09 07:11:41,336 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:41" (1/1) ... [2024-11-09 07:11:41,369 INFO L138 Inliner]: procedures = 119, calls = 52, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 224 [2024-11-09 07:11:41,371 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:11:41,372 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:11:41,372 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:11:41,372 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:11:41,383 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:41" (1/1) ... [2024-11-09 07:11:41,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:41" (1/1) ... [2024-11-09 07:11:41,387 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:41" (1/1) ... [2024-11-09 07:11:41,412 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-11-09 07:11:41,413 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:41" (1/1) ... [2024-11-09 07:11:41,413 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:41" (1/1) ... [2024-11-09 07:11:41,425 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:41" (1/1) ... [2024-11-09 07:11:41,436 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:41" (1/1) ... [2024-11-09 07:11:41,438 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:41" (1/1) ... [2024-11-09 07:11:41,440 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:41" (1/1) ... [2024-11-09 07:11:41,446 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:11:41,450 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:11:41,450 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:11:41,450 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:11:41,451 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:41" (1/1) ... [2024-11-09 07:11:41,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:11:41,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:11:41,484 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:11:41,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:11:41,557 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-09 07:11:41,559 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-09 07:11:41,559 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 07:11:41,560 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 07:11:41,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 07:11:41,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 07:11:41,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:11:41,560 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:11:41,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:11:41,560 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 07:11:41,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:11:41,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 07:11:41,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:11:41,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 07:11:41,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 07:11:41,561 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:11:41,563 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:11:41,726 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:11:41,728 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:11:42,014 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-09 07:11:42,014 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:11:42,030 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:11:42,031 INFO L316 CfgBuilder]: Removed 31 assume(true) statements. [2024-11-09 07:11:42,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:11:42 BoogieIcfgContainer [2024-11-09 07:11:42,032 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:11:42,034 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:11:42,035 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:11:42,038 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:11:42,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:11:40" (1/3) ... [2024-11-09 07:11:42,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e57626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:11:42, skipping insertion in model container [2024-11-09 07:11:42,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:11:41" (2/3) ... [2024-11-09 07:11:42,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e57626 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:11:42, skipping insertion in model container [2024-11-09 07:11:42,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:11:42" (3/3) ... [2024-11-09 07:11:42,041 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-queue-2.i [2024-11-09 07:11:42,057 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:11:42,058 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-09 07:11:42,107 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:11:42,114 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;@489919d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:11:42,115 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-09 07:11:42,120 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 73 states have (on average 1.8082191780821917) internal successors, (132), 75 states have internal predecessors, (132), 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-11-09 07:11:42,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-09 07:11:42,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:42,127 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:11:42,128 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:11:42,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:42,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1525442300, now seen corresponding path program 1 times [2024-11-09 07:11:42,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:11:42,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257040124] [2024-11-09 07:11:42,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:42,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:42,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:42,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:11:42,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257040124] [2024-11-09 07:11:42,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257040124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:11:42,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:11:42,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:11:42,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949859492] [2024-11-09 07:11:42,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:11:42,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 07:11:42,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:11:42,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 07:11:42,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 07:11:42,362 INFO L87 Difference]: Start difference. First operand has 91 states, 73 states have (on average 1.8082191780821917) internal successors, (132), 75 states have internal predecessors, (132), 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 3.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-11-09 07:11:42,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:11:42,377 INFO L93 Difference]: Finished difference Result 75 states and 98 transitions. [2024-11-09 07:11:42,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 07:11:42,379 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.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-11-09 07:11:42,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:11:42,385 INFO L225 Difference]: With dead ends: 75 [2024-11-09 07:11:42,385 INFO L226 Difference]: Without dead ends: 73 [2024-11-09 07:11:42,387 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-11-09 07:11:42,389 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:11:42,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:11:42,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-09 07:11:42,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2024-11-09 07:11:42,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 57 states have (on average 1.4385964912280702) internal successors, (82), 71 states have internal predecessors, (82), 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-11-09 07:11:42,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 96 transitions. [2024-11-09 07:11:42,432 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 96 transitions. Word has length 7 [2024-11-09 07:11:42,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:11:42,432 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 96 transitions. [2024-11-09 07:11:42,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.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-11-09 07:11:42,433 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 96 transitions. [2024-11-09 07:11:42,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-09 07:11:42,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:42,433 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:11:42,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:11:42,434 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:11:42,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:42,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1651115684, now seen corresponding path program 1 times [2024-11-09 07:11:42,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:11:42,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868148043] [2024-11-09 07:11:42,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:42,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:42,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:42,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:11:42,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868148043] [2024-11-09 07:11:42,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868148043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:11:42,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:11:42,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:11:42,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250183657] [2024-11-09 07:11:42,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:11:42,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:11:42,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:11:42,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:11:42,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:11:42,541 INFO L87 Difference]: Start difference. First operand 73 states and 96 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-11-09 07:11:42,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:11:42,599 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2024-11-09 07:11:42,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:11:42,600 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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 8 [2024-11-09 07:11:42,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:11:42,601 INFO L225 Difference]: With dead ends: 69 [2024-11-09 07:11:42,601 INFO L226 Difference]: Without dead ends: 69 [2024-11-09 07:11:42,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:11:42,603 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 67 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:11:42,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 86 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:11:42,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-09 07:11:42,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-09 07:11:42,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 67 states have internal predecessors, (78), 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-11-09 07:11:42,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 87 transitions. [2024-11-09 07:11:42,617 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 87 transitions. Word has length 8 [2024-11-09 07:11:42,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:11:42,617 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 87 transitions. [2024-11-09 07:11:42,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 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-11-09 07:11:42,618 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 87 transitions. [2024-11-09 07:11:42,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-09 07:11:42,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:42,619 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:11:42,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:11:42,620 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:11:42,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:42,621 INFO L85 PathProgramCache]: Analyzing trace with hash -744980996, now seen corresponding path program 1 times [2024-11-09 07:11:42,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:11:42,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512865031] [2024-11-09 07:11:42,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:42,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:42,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:42,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:11:42,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512865031] [2024-11-09 07:11:42,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512865031] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:11:42,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:11:42,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:11:42,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363450295] [2024-11-09 07:11:42,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:11:42,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:11:42,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:11:42,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:11:42,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:11:42,990 INFO L87 Difference]: Start difference. First operand 69 states and 87 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-11-09 07:11:43,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:11:43,146 INFO L93 Difference]: Finished difference Result 110 states and 138 transitions. [2024-11-09 07:11:43,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:11:43,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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 11 [2024-11-09 07:11:43,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:11:43,148 INFO L225 Difference]: With dead ends: 110 [2024-11-09 07:11:43,149 INFO L226 Difference]: Without dead ends: 110 [2024-11-09 07:11:43,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:11:43,151 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 138 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 142 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-11-09 07:11:43,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 142 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:11:43,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-09 07:11:43,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 68. [2024-11-09 07:11:43,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 66 states have internal predecessors, (77), 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-11-09 07:11:43,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 85 transitions. [2024-11-09 07:11:43,163 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 85 transitions. Word has length 11 [2024-11-09 07:11:43,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:11:43,163 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 85 transitions. [2024-11-09 07:11:43,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-11-09 07:11:43,164 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 85 transitions. [2024-11-09 07:11:43,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-09 07:11:43,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:43,164 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:11:43,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:11:43,165 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:11:43,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:43,166 INFO L85 PathProgramCache]: Analyzing trace with hash 176108302, now seen corresponding path program 1 times [2024-11-09 07:11:43,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:11:43,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053058905] [2024-11-09 07:11:43,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:43,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:43,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:43,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:11:43,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053058905] [2024-11-09 07:11:43,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053058905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:11:43,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:11:43,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:11:43,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789169667] [2024-11-09 07:11:43,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:11:43,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:11:43,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:11:43,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:11:43,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:11:43,238 INFO L87 Difference]: Start difference. First operand 68 states and 85 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-11-09 07:11:43,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:11:43,291 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. [2024-11-09 07:11:43,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:11:43,293 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 14 [2024-11-09 07:11:43,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:11:43,294 INFO L225 Difference]: With dead ends: 91 [2024-11-09 07:11:43,294 INFO L226 Difference]: Without dead ends: 91 [2024-11-09 07:11:43,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:11:43,295 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 21 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:11:43,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 149 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:11:43,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-09 07:11:43,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 76. [2024-11-09 07:11:43,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 66 states have (on average 1.303030303030303) internal successors, (86), 74 states have internal predecessors, (86), 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-11-09 07:11:43,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 94 transitions. [2024-11-09 07:11:43,308 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 94 transitions. Word has length 14 [2024-11-09 07:11:43,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:11:43,309 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 94 transitions. [2024-11-09 07:11:43,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-11-09 07:11:43,309 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 94 transitions. [2024-11-09 07:11:43,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:11:43,310 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:43,310 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:11:43,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:11:43,310 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:11:43,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:43,311 INFO L85 PathProgramCache]: Analyzing trace with hash 421022757, now seen corresponding path program 1 times [2024-11-09 07:11:43,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:11:43,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653480669] [2024-11-09 07:11:43,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:43,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:43,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:43,491 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:11:43,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:11:43,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653480669] [2024-11-09 07:11:43,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653480669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:11:43,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:11:43,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:11:43,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946171657] [2024-11-09 07:11:43,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:11:43,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:11:43,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:11:43,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:11:43,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:11:43,493 INFO L87 Difference]: Start difference. First operand 76 states and 94 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:43,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:11:43,615 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2024-11-09 07:11:43,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:11:43,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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-11-09 07:11:43,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:11:43,617 INFO L225 Difference]: With dead ends: 86 [2024-11-09 07:11:43,618 INFO L226 Difference]: Without dead ends: 86 [2024-11-09 07:11:43,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-11-09 07:11:43,619 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 13 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:11:43,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 287 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:11:43,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-09 07:11:43,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 80. [2024-11-09 07:11:43,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 70 states have (on average 1.2857142857142858) internal successors, (90), 78 states have internal predecessors, (90), 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-11-09 07:11:43,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2024-11-09 07:11:43,631 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 98 transitions. Word has length 17 [2024-11-09 07:11:43,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:11:43,631 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 98 transitions. [2024-11-09 07:11:43,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:43,632 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2024-11-09 07:11:43,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:11:43,632 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:43,633 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:11:43,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:11:43,633 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:11:43,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:43,634 INFO L85 PathProgramCache]: Analyzing trace with hash 478281059, now seen corresponding path program 1 times [2024-11-09 07:11:43,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:11:43,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928364111] [2024-11-09 07:11:43,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:43,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:43,724 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:43,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:11:43,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928364111] [2024-11-09 07:11:43,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928364111] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:11:43,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842177231] [2024-11-09 07:11:43,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:43,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:11:43,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:11:43,733 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:11:43,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:11:43,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:43,821 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 07:11:43,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:11:43,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-09 07:11:43,954 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:43,955 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:11:43,995 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:43,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842177231] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:11:43,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:11:43,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2024-11-09 07:11:43,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199477013] [2024-11-09 07:11:43,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:11:43,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:11:43,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:11:43,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:11:43,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:11:43,999 INFO L87 Difference]: Start difference. First operand 80 states and 98 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:44,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:11:44,043 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2024-11-09 07:11:44,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:11:44,044 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-09 07:11:44,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:11:44,045 INFO L225 Difference]: With dead ends: 85 [2024-11-09 07:11:44,045 INFO L226 Difference]: Without dead ends: 83 [2024-11-09 07:11:44,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 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-11-09 07:11:44,046 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:11:44,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 222 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:11:44,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-09 07:11:44,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2024-11-09 07:11:44,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 72 states have (on average 1.2777777777777777) internal successors, (92), 80 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-11-09 07:11:44,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 100 transitions. [2024-11-09 07:11:44,057 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 100 transitions. Word has length 17 [2024-11-09 07:11:44,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:11:44,060 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 100 transitions. [2024-11-09 07:11:44,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:44,060 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 100 transitions. [2024-11-09 07:11:44,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:11:44,061 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:44,061 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:11:44,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 07:11:44,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-09 07:11:44,262 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:11:44,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:44,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1941865044, now seen corresponding path program 2 times [2024-11-09 07:11:44,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:11:44,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941726452] [2024-11-09 07:11:44,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:44,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:44,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:44,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:11:44,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941726452] [2024-11-09 07:11:44,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941726452] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:11:44,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1277390072] [2024-11-09 07:11:44,435 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:11:44,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:11:44,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:11:44,439 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:11:44,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:11:44,533 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:11:44,533 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:11:44,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 07:11:44,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:11:44,549 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 27 treesize of output 17 [2024-11-09 07:11:44,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:44,763 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:11:44,826 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-11-09 07:11:44,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:44,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1277390072] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:11:44,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:11:44,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2024-11-09 07:11:44,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298130915] [2024-11-09 07:11:44,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:11:44,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:11:44,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:11:44,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:11:44,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:11:44,858 INFO L87 Difference]: Start difference. First operand 82 states and 100 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:45,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:11:45,197 INFO L93 Difference]: Finished difference Result 142 states and 174 transitions. [2024-11-09 07:11:45,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:11:45,198 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-09 07:11:45,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:11:45,199 INFO L225 Difference]: With dead ends: 142 [2024-11-09 07:11:45,199 INFO L226 Difference]: Without dead ends: 131 [2024-11-09 07:11:45,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:11:45,200 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 94 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 378 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 818 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:11:45,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 818 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 378 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:11:45,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-09 07:11:45,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 77. [2024-11-09 07:11:45,208 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-11-09 07:11:45,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 95 transitions. [2024-11-09 07:11:45,210 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 95 transitions. Word has length 18 [2024-11-09 07:11:45,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:11:45,210 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 95 transitions. [2024-11-09 07:11:45,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 12 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:45,210 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 95 transitions. [2024-11-09 07:11:45,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 07:11:45,211 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:45,211 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-11-09 07:11:45,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-09 07:11:45,411 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,SelfDestructingSolverStorable6 [2024-11-09 07:11:45,412 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:11:45,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:45,412 INFO L85 PathProgramCache]: Analyzing trace with hash 227239491, now seen corresponding path program 1 times [2024-11-09 07:11:45,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:11:45,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44416935] [2024-11-09 07:11:45,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:45,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:45,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:45,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:45,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:11:45,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44416935] [2024-11-09 07:11:45,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44416935] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:11:45,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689911756] [2024-11-09 07:11:45,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:45,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:11:45,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:11:45,679 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:11:45,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:11:45,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:45,779 INFO L255 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 07:11:45,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:11:45,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:11:45,821 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 18 treesize of output 18 [2024-11-09 07:11:45,825 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 30 treesize of output 22 [2024-11-09 07:11:45,832 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-11-09 07:11:45,847 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:11:45,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:11:45,857 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-11-09 07:11:45,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:11:45,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:11:45,873 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 07:11:45,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:11:45,950 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-11-09 07:11:45,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:45,957 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:11:46,051 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:11:46,051 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 75 treesize of output 59 [2024-11-09 07:11:46,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:11:46,073 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 186 treesize of output 145 [2024-11-09 07:11:46,091 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:11:46,092 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 128 treesize of output 124 [2024-11-09 07:11: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 80 treesize of output 74 [2024-11-09 07:11:46,116 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:11:46,116 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 35 treesize of output 36 [2024-11-09 07:11:46,128 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 48 treesize of output 40 [2024-11-09 07:11:46,139 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 27 treesize of output 25 [2024-11-09 07:11:46,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:46,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [689911756] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:11:46,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:11:46,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 11 [2024-11-09 07:11:46,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041689173] [2024-11-09 07:11:46,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:11:46,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:11:46,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:11:46,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:11:46,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=82, Unknown=1, NotChecked=0, Total=110 [2024-11-09 07:11:46,423 INFO L87 Difference]: Start difference. First operand 77 states and 95 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 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-11-09 07:11:46,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:11:46,668 INFO L93 Difference]: Finished difference Result 145 states and 181 transitions. [2024-11-09 07:11:46,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:11:46,669 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 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-11-09 07:11:46,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:11:46,670 INFO L225 Difference]: With dead ends: 145 [2024-11-09 07:11:46,670 INFO L226 Difference]: Without dead ends: 145 [2024-11-09 07:11:46,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=127, Unknown=2, NotChecked=0, Total=182 [2024-11-09 07:11:46,671 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 205 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:11:46,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 353 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 180 Invalid, 1 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:11:46,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-09 07:11:46,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 90. [2024-11-09 07:11:46,678 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-11-09 07:11:46,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 110 transitions. [2024-11-09 07:11:46,679 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 110 transitions. Word has length 21 [2024-11-09 07:11:46,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:11:46,679 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 110 transitions. [2024-11-09 07:11:46,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 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-11-09 07:11:46,680 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 110 transitions. [2024-11-09 07:11:46,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:11:46,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:46,680 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] [2024-11-09 07:11:46,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-09 07:11:46,881 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-11-09 07:11:46,881 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:11:46,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:46,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1176120509, now seen corresponding path program 1 times [2024-11-09 07:11:46,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:11:46,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731259705] [2024-11-09 07:11:46,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:46,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:46,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:46,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:11:46,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731259705] [2024-11-09 07:11:46,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731259705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:11:46,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:11:46,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:11:46,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346660950] [2024-11-09 07:11:46,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:11:46,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:11:46,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:11:46,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:11:46,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:11:46,925 INFO L87 Difference]: Start difference. First operand 90 states and 110 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-11-09 07:11:46,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:11:46,954 INFO L93 Difference]: Finished difference Result 124 states and 149 transitions. [2024-11-09 07:11:46,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:11:46,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 22 [2024-11-09 07:11:46,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:11:46,955 INFO L225 Difference]: With dead ends: 124 [2024-11-09 07:11:46,956 INFO L226 Difference]: Without dead ends: 124 [2024-11-09 07:11:46,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:11:46,956 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 28 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:11:46,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 144 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:11:46,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-09 07:11:46,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 103. [2024-11-09 07:11:46,960 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-11-09 07:11:46,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 123 transitions. [2024-11-09 07:11:46,961 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 123 transitions. Word has length 22 [2024-11-09 07:11:46,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:11:46,961 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 123 transitions. [2024-11-09 07:11:46,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-11-09 07:11:46,962 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 123 transitions. [2024-11-09 07:11:46,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:11:46,962 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:46,963 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-11-09 07:11:46,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:11:46,963 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:11:46,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:46,963 INFO L85 PathProgramCache]: Analyzing trace with hash 622380787, now seen corresponding path program 1 times [2024-11-09 07:11:46,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:11:46,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626137419] [2024-11-09 07:11:46,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:46,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:46,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:47,026 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 07:11:47,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:11:47,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626137419] [2024-11-09 07:11:47,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626137419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:11:47,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:11:47,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:11:47,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325908118] [2024-11-09 07:11:47,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:11:47,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:11:47,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:11:47,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:11:47,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:11:47,028 INFO L87 Difference]: Start difference. First operand 103 states and 123 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-11-09 07:11:47,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:11:47,058 INFO L93 Difference]: Finished difference Result 138 states and 164 transitions. [2024-11-09 07:11:47,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:11:47,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-11-09 07:11:47,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:11:47,059 INFO L225 Difference]: With dead ends: 138 [2024-11-09 07:11:47,059 INFO L226 Difference]: Without dead ends: 138 [2024-11-09 07:11:47,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:11:47,060 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 33 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:11:47,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 167 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:11:47,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-09 07:11:47,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 116. [2024-11-09 07:11:47,070 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-11-09 07:11:47,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 137 transitions. [2024-11-09 07:11:47,071 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 137 transitions. Word has length 29 [2024-11-09 07:11:47,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:11:47,072 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 137 transitions. [2024-11-09 07:11:47,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-11-09 07:11:47,072 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 137 transitions. [2024-11-09 07:11:47,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:11:47,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:47,072 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:11:47,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:11:47,073 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:11:47,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:47,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1749267135, now seen corresponding path program 1 times [2024-11-09 07:11:47,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:11:47,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924435602] [2024-11-09 07:11:47,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:47,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:47,190 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:11:47,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:11:47,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924435602] [2024-11-09 07:11:47,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924435602] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:11:47,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041170709] [2024-11-09 07:11:47,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:47,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:11:47,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:11:47,193 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:11:47,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 07:11:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:47,307 INFO L255 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 07:11:47,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:11:47,382 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-11-09 07:11:47,385 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-11-09 07:11:47,390 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:11:47,391 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:11:47,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:11:47,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041170709] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:11:47,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:11:47,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 9 [2024-11-09 07:11:47,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827025920] [2024-11-09 07:11:47,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:11:47,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:11:47,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:11:47,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:11:47,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:11:47,447 INFO L87 Difference]: Start difference. First operand 116 states and 137 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:47,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:11:47,669 INFO L93 Difference]: Finished difference Result 129 states and 153 transitions. [2024-11-09 07:11:47,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:11:47,669 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-09 07:11:47,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:11:47,670 INFO L225 Difference]: With dead ends: 129 [2024-11-09 07:11:47,670 INFO L226 Difference]: Without dead ends: 129 [2024-11-09 07:11:47,671 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:11:47,671 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 127 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:11:47,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 340 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:11:47,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2024-11-09 07:11:47,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 121. [2024-11-09 07:11:47,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 111 states have (on average 1.2072072072072073) internal successors, (134), 119 states have internal predecessors, (134), 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-11-09 07:11:47,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 142 transitions. [2024-11-09 07:11:47,678 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 142 transitions. Word has length 29 [2024-11-09 07:11:47,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:11:47,679 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 142 transitions. [2024-11-09 07:11:47,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:47,679 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 142 transitions. [2024-11-09 07:11:47,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 07:11:47,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:47,680 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, 1] [2024-11-09 07:11:47,697 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 07:11:47,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:11:47,881 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:11:47,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:47,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1811642221, now seen corresponding path program 1 times [2024-11-09 07:11:47,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:11:47,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322810864] [2024-11-09 07:11:47,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:47,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:47,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:48,400 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:48,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:11:48,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322810864] [2024-11-09 07:11:48,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322810864] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:11:48,400 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601570034] [2024-11-09 07:11:48,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:48,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:11:48,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:11:48,402 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:11:48,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 07:11:48,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:48,526 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-09 07:11:48,529 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:11:48,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:11:48,554 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 18 treesize of output 18 [2024-11-09 07:11:48,557 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 30 treesize of output 22 [2024-11-09 07:11:48,562 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-11-09 07:11:48,579 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 07:11:48,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 07:11:48,595 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-11-09 07:11:48,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:11:48,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:11:48,609 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-11-09 07:11:48,615 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 07:11:48,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:11:48,734 INFO L349 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2024-11-09 07:11:48,735 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-11-09 07:11:48,744 INFO L349 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2024-11-09 07:11:48,745 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-11-09 07:11:48,759 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-09 07:11:48,759 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-11-09 07:11:48,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:11:48,774 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-09 07:11:48,774 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-11-09 07:11:48,793 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-09 07:11:48,793 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-11-09 07:11:48,847 INFO L349 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2024-11-09 07:11:48,847 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-11-09 07:11:48,956 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-09 07:11:48,957 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-11-09 07:11:48,960 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:48,961 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:11:49,151 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:11:49,152 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-11-09 07:11:49,221 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:11:49,222 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 181 treesize of output 141 [2024-11-09 07:11:49,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:11:49,231 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 207 treesize of output 175 [2024-11-09 07:11:49,250 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:11:49,251 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 6952 treesize of output 5343 [2024-11-09 07:11:49,333 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 4516 treesize of output 3928 [2024-11-09 07:11:49,488 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 1554 treesize of output 1390 [2024-11-09 07:11:49,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:11:49,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1363 treesize of output 1135 [2024-11-09 07:11:49,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:11:49,559 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 1110 treesize of output 1048 [2024-11-09 07:11:49,603 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:11:49,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1014 treesize of output 967 [2024-11-09 07:11:49,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 942 treesize of output 904 [2024-11-09 07:11:51,141 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:51,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601570034] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:11:51,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:11:51,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 18 [2024-11-09 07:11:51,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129525412] [2024-11-09 07:11:51,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:11:51,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 07:11:51,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:11:51,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 07:11:51,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=235, Unknown=8, NotChecked=0, Total=306 [2024-11-09 07:11:51,143 INFO L87 Difference]: Start difference. First operand 121 states and 142 transitions. Second operand has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 18 states have internal predecessors, (64), 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-11-09 07:11:51,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:11:51,658 INFO L93 Difference]: Finished difference Result 180 states and 213 transitions. [2024-11-09 07:11:51,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:11:51,659 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 18 states have internal predecessors, (64), 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-11-09 07:11:51,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:11:51,660 INFO L225 Difference]: With dead ends: 180 [2024-11-09 07:11:51,660 INFO L226 Difference]: Without dead ends: 180 [2024-11-09 07:11:51,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=158, Invalid=483, Unknown=9, NotChecked=0, Total=650 [2024-11-09 07:11:51,661 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 666 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:11:51,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 464 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:11:51,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-09 07:11:51,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 120. [2024-11-09 07:11:51,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 111 states have (on average 1.1981981981981982) internal successors, (133), 118 states have internal predecessors, (133), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:51,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 140 transitions. [2024-11-09 07:11:51,665 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 140 transitions. Word has length 30 [2024-11-09 07:11:51,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:11:51,665 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 140 transitions. [2024-11-09 07:11:51,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.5555555555555554) internal successors, (64), 18 states have internal predecessors, (64), 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-11-09 07:11:51,666 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 140 transitions. [2024-11-09 07:11:51,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 07:11:51,666 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:51,667 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:11:51,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-09 07:11:51,867 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-11-09 07:11:51,868 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:11:51,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:51,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1607239560, now seen corresponding path program 2 times [2024-11-09 07:11:51,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:11:51,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704984786] [2024-11-09 07:11:51,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:51,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:52,244 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:52,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:11:52,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704984786] [2024-11-09 07:11:52,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704984786] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:11:52,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902247016] [2024-11-09 07:11:52,245 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:11:52,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:11:52,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:11:52,247 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:11:52,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 07:11:52,362 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:11:52,362 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:11:52,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 07:11:52,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:11:52,415 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-11-09 07:11:52,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:11:52,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:11:52,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:11:52,427 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-11-09 07:11:52,437 INFO L349 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2024-11-09 07:11:52,438 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 97 treesize of output 65 [2024-11-09 07:11:52,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2024-11-09 07:11:52,477 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:11:52,478 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 45 [2024-11-09 07:11:52,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 23 [2024-11-09 07:11:52,705 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~item~0#1.base_45| Int) (|v_ULTIMATE.start_main_~item~0#1.base_46| Int)) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~item~0#1.base_45|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~item~0#1.base_45| 0) |v_ULTIMATE.start_main_~item~0#1.base_46| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~item~0#1.base_45| 1) |v_ULTIMATE.start_main_~item~0#1.base_46|) 0))) is different from true [2024-11-09 07:11:52,719 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-09 07:11:52,719 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:11:52,769 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_714 (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_714) |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-11-09 07:11:52,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:11:52,779 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-11-09 07:11:52,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:11:52,789 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-11-09 07:11:52,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:11:52,803 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 259 treesize of output 255 [2024-11-09 07:11:52,810 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 247 treesize of output 239 [2024-11-09 07:11:54,497 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:54,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902247016] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:11:54,498 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:11:54,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2024-11-09 07:11:54,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963560374] [2024-11-09 07:11:54,498 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:11:54,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 07:11:54,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:11:54,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 07:11:54,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=120, Unknown=2, NotChecked=46, Total=210 [2024-11-09 07:11:54,501 INFO L87 Difference]: Start difference. First operand 120 states and 140 transitions. Second operand has 15 states, 14 states have (on average 6.0) internal successors, (84), 15 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:55,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:11:55,450 INFO L93 Difference]: Finished difference Result 149 states and 176 transitions. [2024-11-09 07:11:55,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:11:55,451 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 6.0) internal successors, (84), 15 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-11-09 07:11:55,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:11:55,452 INFO L225 Difference]: With dead ends: 149 [2024-11-09 07:11:55,452 INFO L226 Difference]: Without dead ends: 147 [2024-11-09 07:11:55,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=45, Invalid=143, Unknown=2, NotChecked=50, Total=240 [2024-11-09 07:11:55,452 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 56 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 208 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 07:11:55,453 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 429 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 147 Invalid, 0 Unknown, 208 Unchecked, 0.9s Time] [2024-11-09 07:11:55,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-09 07:11:55,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 136. [2024-11-09 07:11:55,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 127 states have (on average 1.204724409448819) internal successors, (153), 134 states have internal predecessors, (153), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:55,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 160 transitions. [2024-11-09 07:11:55,456 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 160 transitions. Word has length 30 [2024-11-09 07:11:55,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:11:55,456 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 160 transitions. [2024-11-09 07:11:55,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 6.0) internal successors, (84), 15 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:55,457 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 160 transitions. [2024-11-09 07:11:55,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 07:11:55,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:55,458 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:11:55,474 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 07:11:55,662 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-11-09 07:11:55,663 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:11:55,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:55,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1777882656, now seen corresponding path program 1 times [2024-11-09 07:11:55,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:11:55,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946419334] [2024-11-09 07:11:55,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:55,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:55,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:11:55,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:11:55,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946419334] [2024-11-09 07:11:55,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946419334] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:11:55,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:11:55,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:11:55,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931337668] [2024-11-09 07:11:55,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:11:55,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:11:55,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:11:55,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:11:55,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:11:55,695 INFO L87 Difference]: Start difference. First operand 136 states and 160 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-11-09 07:11:55,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:11:55,704 INFO L93 Difference]: Finished difference Result 138 states and 162 transitions. [2024-11-09 07:11:55,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:11:55,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 31 [2024-11-09 07:11:55,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:11:55,706 INFO L225 Difference]: With dead ends: 138 [2024-11-09 07:11:55,706 INFO L226 Difference]: Without dead ends: 138 [2024-11-09 07:11:55,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:11:55,707 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 0 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:11:55,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 157 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:11:55,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-09 07:11:55,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-11-09 07:11:55,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 129 states have (on average 1.2015503875968991) internal successors, (155), 136 states have internal predecessors, (155), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:55,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 162 transitions. [2024-11-09 07:11:55,711 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 162 transitions. Word has length 31 [2024-11-09 07:11:55,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:11:55,711 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 162 transitions. [2024-11-09 07:11:55,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-11-09 07:11:55,711 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 162 transitions. [2024-11-09 07:11:55,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 07:11:55,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:55,712 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:11:55,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:11:55,712 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:11:55,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:55,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1776035614, now seen corresponding path program 1 times [2024-11-09 07:11:55,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:11:55,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238648441] [2024-11-09 07:11:55,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:55,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:55,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:56,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:56,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:11:56,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238648441] [2024-11-09 07:11:56,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238648441] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:11:56,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439624060] [2024-11-09 07:11:56,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:56,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:11:56,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:11:56,261 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:11:56,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 07:11:56,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:56,383 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-09 07:11:56,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:11:56,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:11:56,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:11:56,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:11:56,431 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 36 treesize of output 26 [2024-11-09 07:11:56,434 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 16 treesize of output 16 [2024-11-09 07:11:56,446 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:11:56,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2024-11-09 07:11:56,450 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-11-09 07:11:56,457 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-11-09 07:11:56,470 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:11:56,471 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-11-09 07:11:56,476 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-11-09 07:11:56,486 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-11-09 07:11:56,496 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:11:56,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:11:56,531 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:11:56,531 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 79 treesize of output 68 [2024-11-09 07:11:56,537 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 27 treesize of output 1 [2024-11-09 07:11:56,542 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 07:11:56,653 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 27 treesize of output 15 [2024-11-09 07:11:56,657 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 7 treesize of output 3 [2024-11-09 07:11:56,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-09 07:11:56,693 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:56,694 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:11:56,761 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-11-09 07:11:56,767 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_853 (Array Int Int))) (= |c_ULTIMATE.start_main_~item~0#1.offset| (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_853) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_851 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_851) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~item~0#1.base|))) is different from false [2024-11-09 07:11:56,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:11:56,778 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 155 treesize of output 148 [2024-11-09 07:11:56,808 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-09 07:11:56,808 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 232 treesize of output 227 [2024-11-09 07:11:56,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:11:56,840 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 246 treesize of output 232 [2024-11-09 07:11:56,851 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 177 treesize of output 171 [2024-11-09 07:11:56,888 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:11:56,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 371 treesize of output 357 [2024-11-09 07:11:56,913 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 248 treesize of output 240 [2024-11-09 07:11:56,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:11:56,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 240 treesize of output 251 [2024-11-09 07:11:57,476 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 7 treesize of output 5 [2024-11-09 07:11:57,491 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-11-09 07:11:57,532 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:57,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439624060] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:11:57,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:11:57,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 17 [2024-11-09 07:11:57,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422338963] [2024-11-09 07:11:57,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:11:57,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 07:11:57,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:11:57,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 07:11:57,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=203, Unknown=1, NotChecked=28, Total=272 [2024-11-09 07:11:57,534 INFO L87 Difference]: Start difference. First operand 138 states and 162 transitions. Second operand has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 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-11-09 07:11:57,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:11:57,967 INFO L93 Difference]: Finished difference Result 202 states and 238 transitions. [2024-11-09 07:11:57,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:11:57,968 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 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 31 [2024-11-09 07:11:57,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:11:57,968 INFO L225 Difference]: With dead ends: 202 [2024-11-09 07:11:57,969 INFO L226 Difference]: Without dead ends: 202 [2024-11-09 07:11:57,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=397, Unknown=1, NotChecked=42, Total=552 [2024-11-09 07:11:57,969 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 238 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:11:57,969 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 713 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 335 Invalid, 0 Unknown, 124 Unchecked, 0.3s Time] [2024-11-09 07:11:57,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2024-11-09 07:11:57,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 141. [2024-11-09 07:11:57,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 132 states have (on average 1.2121212121212122) internal successors, (160), 139 states have internal predecessors, (160), 7 states have call successors, (7), 1 states have call predecessors, (7), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:11:57,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 167 transitions. [2024-11-09 07:11:57,975 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 167 transitions. Word has length 31 [2024-11-09 07:11:57,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:11:57,976 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 167 transitions. [2024-11-09 07:11:57,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.823529411764706) internal successors, (82), 17 states have internal predecessors, (82), 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-11-09 07:11:57,976 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 167 transitions. [2024-11-09 07:11:57,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 07:11:57,978 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:11:57,978 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, 1] [2024-11-09 07:11:57,996 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 07:11:58,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:11:58,183 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-09 07:11:58,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:11:58,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1715235295, now seen corresponding path program 3 times [2024-11-09 07:11:58,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:11:58,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529019999] [2024-11-09 07:11:58,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:11:58,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:11:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:11:58,549 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:58,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:11:58,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529019999] [2024-11-09 07:11:58,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529019999] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:11:58,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619742521] [2024-11-09 07:11:58,550 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 07:11:58,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:11:58,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:11:58,552 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-11-09 07:11:58,553 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-11-09 07:11:58,773 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 07:11:58,773 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:11:58,775 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-09 07:11:58,778 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:11:58,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 07:11:58,822 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 07:11:58,822 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 15 treesize of output 15 [2024-11-09 07:11:58,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:11:58,835 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 43 treesize of output 15 [2024-11-09 07:11:58,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:11:58,852 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2024-11-09 07:11:58,853 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 2 case distinctions, treesize of input 115 treesize of output 15 [2024-11-09 07:11:58,861 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 64 treesize of output 47 [2024-11-09 07:11:58,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:11:58,865 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:11:58,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:11:58,867 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:11:58,869 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 31 treesize of output 28 [2024-11-09 07:11:58,874 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 12 treesize of output 11 [2024-11-09 07:11:58,887 WARN L214 Elim1Store]: Array PQE input equivalent to false [2024-11-09 07:11:58,919 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-09 07:11:58,920 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 1 case distinctions, treesize of input 85 treesize of output 58 [2024-11-09 07:11:58,927 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-11-09 07:11:59,174 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:11:59,175 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:11:59,282 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_956 (Array Int Int))) (or (forall ((v_ArrVal_955 (Array Int Int))) (or (= (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_955))) (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_956) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 0) (not (= v_ArrVal_955 (store .cse1 .cse2 (select v_ArrVal_955 .cse2)))))) (not (= v_ArrVal_956 (store .cse3 .cse2 (select v_ArrVal_956 .cse2)))))) (forall ((v_ArrVal_956 (Array Int Int))) (or (forall ((v_ArrVal_955 (Array Int Int))) (or (= (let ((.cse4 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_956))) (select (select .cse4 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~item~0#1.base| v_ArrVal_955) |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_955 (store .cse1 .cse2 (select v_ArrVal_955 .cse2)))))) (not (= v_ArrVal_956 (store .cse3 .cse2 (select v_ArrVal_956 .cse2)))))))) is different from false [2024-11-09 07:11:59,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:11:59,310 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 758 treesize of output 631 [2024-11-09 07:11:59,394 INFO L349 Elim1Store]: treesize reduction 15, result has 70.0 percent of original size [2024-11-09 07:11:59,395 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 694 treesize of output 583 [2024-11-09 07:11:59,769 INFO L349 Elim1Store]: treesize reduction 152, result has 42.4 percent of original size [2024-11-09 07:11:59,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 17 case distinctions, treesize of input 1043 treesize of output 966 [2024-11-09 07:12:00,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:12:00,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 3134 treesize of output 3107 [2024-11-09 07:12:01,030 INFO L349 Elim1Store]: treesize reduction 10, result has 96.4 percent of original size [2024-11-09 07:12:01,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 2956 treesize of output 2552 [2024-11-09 07:12:07,060 WARN L286 SmtUtils]: Spent 5.71s on a formula simplification. DAG size of input: 566 DAG size of output: 235 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-11-09 07:12:07,061 INFO L349 Elim1Store]: treesize reduction 1499, result has 23.3 percent of original size [2024-11-09 07:12:07,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 6 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 17 new quantified variables, introduced 63 case distinctions, treesize of input 1247 treesize of output 1979