./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-properties/list_search-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-properties/list_search-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 b1ea7ddff382751fa0e11562333bdb4981cac7bdbf1d356a007804e7e2e5a289 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 18:08:34,488 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 18:08:34,540 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2024-11-22 18:08:34,544 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 18:08:34,544 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 18:08:34,573 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 18:08:34,573 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 18:08:34,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 18:08:34,574 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 18:08:34,576 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 18:08:34,576 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 18:08:34,577 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 18:08:34,577 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 18:08:34,580 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 18:08:34,580 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 18:08:34,581 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 18:08:34,581 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 18:08:34,581 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 18:08:34,581 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 18:08:34,582 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 18:08:34,582 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 18:08:34,582 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 18:08:34,582 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 18:08:34,583 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 18:08:34,583 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 18:08:34,583 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 18:08:34,583 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 18:08:34,583 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 18:08:34,583 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 18:08:34,584 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 18:08:34,584 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 18:08:34,584 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 18:08:34,584 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 18:08:34,584 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 18:08:34,585 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 18:08:34,585 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 18:08:34,585 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:08:34,585 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 18:08:34,585 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 18:08:34,586 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 18:08:34,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 18:08:34,588 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 18:08:34,588 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 18:08:34,589 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 18:08:34,589 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 18:08:34,589 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 -> b1ea7ddff382751fa0e11562333bdb4981cac7bdbf1d356a007804e7e2e5a289 [2024-11-22 18:08:34,878 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 18:08:34,903 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 18:08:34,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 18:08:34,907 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 18:08:34,908 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 18:08:34,910 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list_search-2.i [2024-11-22 18:08:36,314 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 18:08:36,560 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 18:08:36,561 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_search-2.i [2024-11-22 18:08:36,582 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f82717bb6/5aca23ff745549b68862c75cff9aced4/FLAG32e156854 [2024-11-22 18:08:36,600 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f82717bb6/5aca23ff745549b68862c75cff9aced4 [2024-11-22 18:08:36,603 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 18:08:36,604 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 18:08:36,607 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 18:08:36,607 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 18:08:36,613 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 18:08:36,613 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:08:36" (1/1) ... [2024-11-22 18:08:36,614 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44fb97d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:08:36, skipping insertion in model container [2024-11-22 18:08:36,614 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:08:36" (1/1) ... [2024-11-22 18:08:36,661 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 18:08:37,104 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-22 18:08:37,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:08:37,123 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 18:08:37,165 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 18:08:37,224 INFO L204 MainTranslator]: Completed translation [2024-11-22 18:08:37,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:08:37 WrapperNode [2024-11-22 18:08:37,225 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 18:08:37,226 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 18:08:37,226 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 18:08:37,226 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 18:08:37,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:08:37" (1/1) ... [2024-11-22 18:08:37,253 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:08:37" (1/1) ... [2024-11-22 18:08:37,281 INFO L138 Inliner]: procedures = 226, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 102 [2024-11-22 18:08:37,282 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 18:08:37,283 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 18:08:37,283 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 18:08:37,283 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 18:08:37,291 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:08:37" (1/1) ... [2024-11-22 18:08:37,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:08:37" (1/1) ... [2024-11-22 18:08:37,294 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:08:37" (1/1) ... [2024-11-22 18:08:37,311 INFO L175 MemorySlicer]: Split 16 memory accesses to 2 slices as follows [2, 14]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2024-11-22 18:08:37,311 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:08:37" (1/1) ... [2024-11-22 18:08:37,311 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:08:37" (1/1) ... [2024-11-22 18:08:37,321 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:08:37" (1/1) ... [2024-11-22 18:08:37,324 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:08:37" (1/1) ... [2024-11-22 18:08:37,326 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:08:37" (1/1) ... [2024-11-22 18:08:37,327 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:08:37" (1/1) ... [2024-11-22 18:08:37,331 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 18:08:37,332 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 18:08:37,332 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 18:08:37,332 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 18:08:37,333 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:08:37" (1/1) ... [2024-11-22 18:08:37,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 18:08:37,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:08:37,368 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 18:08:37,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 18:08:37,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 18:08:37,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 18:08:37,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 18:08:37,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 18:08:37,417 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 18:08:37,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 18:08:37,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 18:08:37,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 18:08:37,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 18:08:37,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 18:08:37,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 18:08:37,418 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2024-11-22 18:08:37,418 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2024-11-22 18:08:37,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 18:08:37,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 18:08:37,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 18:08:37,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 18:08:37,532 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 18:08:37,533 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 18:08:37,718 INFO L? ?]: Removed 41 outVars from TransFormulas that were not future-live. [2024-11-22 18:08:37,718 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 18:08:37,732 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 18:08:37,733 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-22 18:08:37,733 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:08:37 BoogieIcfgContainer [2024-11-22 18:08:37,733 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 18:08:37,735 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 18:08:37,735 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 18:08:37,739 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 18:08:37,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:08:36" (1/3) ... [2024-11-22 18:08:37,739 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4c4631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:08:37, skipping insertion in model container [2024-11-22 18:08:37,739 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:08:37" (2/3) ... [2024-11-22 18:08:37,740 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c4c4631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:08:37, skipping insertion in model container [2024-11-22 18:08:37,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:08:37" (3/3) ... [2024-11-22 18:08:37,742 INFO L112 eAbstractionObserver]: Analyzing ICFG list_search-2.i [2024-11-22 18:08:37,755 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 18:08:37,755 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-22 18:08:37,793 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 18:08:37,798 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;@9929c27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 18:08:37,798 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-22 18:08:37,802 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 32 states have (on average 1.46875) internal successors, (47), 34 states have internal predecessors, (47), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-22 18:08:37,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-22 18:08:37,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:08:37,810 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:08:37,810 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:08:37,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:08:37,816 INFO L85 PathProgramCache]: Analyzing trace with hash -435527478, now seen corresponding path program 1 times [2024-11-22 18:08:37,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:08:37,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428789747] [2024-11-22 18:08:37,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:08:37,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:08:38,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:08:38,413 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-22 18:08:38,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:08:38,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428789747] [2024-11-22 18:08:38,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428789747] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:08:38,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775468930] [2024-11-22 18:08:38,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:08:38,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:08:38,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:08:38,420 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:08:38,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 18:08:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:08:38,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 18:08:38,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:08:38,641 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-22 18:08:38,641 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:08:38,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [775468930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:08:38,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 18:08:38,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2024-11-22 18:08:38,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055774313] [2024-11-22 18:08:38,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:08:38,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 18:08:38,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:08:38,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 18:08:38,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:08:38,681 INFO L87 Difference]: Start difference. First operand has 40 states, 32 states have (on average 1.46875) internal successors, (47), 34 states have internal predecessors, (47), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-22 18:08:38,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:08:38,698 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2024-11-22 18:08:38,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 18:08:38,700 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 39 [2024-11-22 18:08:38,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:08:38,706 INFO L225 Difference]: With dead ends: 39 [2024-11-22 18:08:38,706 INFO L226 Difference]: Without dead ends: 37 [2024-11-22 18:08:38,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 18:08:38,711 INFO L432 NwaCegarLoop]: 48 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, 48 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-22 18:08:38,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:08:38,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-22 18:08:38,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-22 18:08:38,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 31 states have internal predecessors, (38), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-22 18:08:38,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2024-11-22 18:08:38,750 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 39 [2024-11-22 18:08:38,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:08:38,751 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2024-11-22 18:08:38,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 9.5) internal successors, (19), 2 states have internal predecessors, (19), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-22 18:08:38,752 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2024-11-22 18:08:38,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-22 18:08:38,755 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:08:38,755 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:08:38,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 18:08:38,956 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,SelfDestructingSolverStorable0 [2024-11-22 18:08:38,956 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:08:38,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:08:38,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1995034883, now seen corresponding path program 1 times [2024-11-22 18:08:38,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:08:38,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748119339] [2024-11-22 18:08:38,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:08:38,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:08:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:08:39,111 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-22 18:08:39,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:08:39,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748119339] [2024-11-22 18:08:39,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748119339] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:08:39,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719358464] [2024-11-22 18:08:39,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:08:39,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:08:39,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:08:39,115 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:08:39,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 18:08:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:08:39,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 18:08:39,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:08:39,318 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-22 18:08:39,319 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:08:39,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719358464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:08:39,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 18:08:39,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2024-11-22 18:08:39,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288066817] [2024-11-22 18:08:39,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:08:39,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 18:08:39,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:08:39,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 18:08:39,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:08:39,324 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-22 18:08:39,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:08:39,406 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2024-11-22 18:08:39,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 18:08:39,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2024-11-22 18:08:39,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:08:39,409 INFO L225 Difference]: With dead ends: 48 [2024-11-22 18:08:39,409 INFO L226 Difference]: Without dead ends: 48 [2024-11-22 18:08:39,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:08:39,410 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 40 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:08:39,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 113 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:08:39,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-22 18:08:39,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2024-11-22 18:08:39,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 36 states have internal predecessors, (44), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-22 18:08:39,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2024-11-22 18:08:39,421 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 41 [2024-11-22 18:08:39,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:08:39,422 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2024-11-22 18:08:39,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-22 18:08:39,422 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2024-11-22 18:08:39,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-22 18:08:39,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:08:39,423 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:08:39,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 18:08:39,624 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,SelfDestructingSolverStorable1 [2024-11-22 18:08:39,624 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:08:39,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:08:39,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1996362409, now seen corresponding path program 1 times [2024-11-22 18:08:39,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:08:39,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210268535] [2024-11-22 18:08:39,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:08:39,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:08:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:08:39,983 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-22 18:08:39,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:08:39,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210268535] [2024-11-22 18:08:39,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1210268535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:08:39,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:08:39,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-22 18:08:39,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475469674] [2024-11-22 18:08:39,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:08:39,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 18:08:39,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:08:39,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 18:08:39,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 18:08:39,986 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-22 18:08:40,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:08:40,054 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2024-11-22 18:08:40,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 18:08:40,056 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2024-11-22 18:08:40,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:08:40,057 INFO L225 Difference]: With dead ends: 47 [2024-11-22 18:08:40,057 INFO L226 Difference]: Without dead ends: 47 [2024-11-22 18:08:40,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-22 18:08:40,058 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 8 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 18:08:40,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 185 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 18:08:40,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2024-11-22 18:08:40,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2024-11-22 18:08:40,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 40 states have (on average 1.225) internal successors, (49), 40 states have internal predecessors, (49), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-22 18:08:40,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 57 transitions. [2024-11-22 18:08:40,066 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 57 transitions. Word has length 42 [2024-11-22 18:08:40,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:08:40,066 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 57 transitions. [2024-11-22 18:08:40,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-22 18:08:40,067 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 57 transitions. [2024-11-22 18:08:40,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-22 18:08:40,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:08:40,068 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:08:40,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 18:08:40,069 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:08:40,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:08:40,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1489258261, now seen corresponding path program 1 times [2024-11-22 18:08:40,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:08:40,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892745152] [2024-11-22 18:08:40,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:08:40,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:08:40,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:08:40,234 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-22 18:08:40,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:08:40,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892745152] [2024-11-22 18:08:40,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892745152] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:08:40,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635735490] [2024-11-22 18:08:40,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:08:40,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:08:40,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:08:40,239 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:08:40,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 18:08:40,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:08:40,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 18:08:40,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:08:40,562 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-22 18:08:40,563 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:08:40,707 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-22 18:08:40,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635735490] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 18:08:40,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:08:40,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8, 8] total 16 [2024-11-22 18:08:40,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835050455] [2024-11-22 18:08:40,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:08:40,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 18:08:40,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:08:40,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 18:08:40,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-22 18:08:40,710 INFO L87 Difference]: Start difference. First operand 47 states and 57 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-22 18:08:40,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:08:40,882 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2024-11-22 18:08:40,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 18:08:40,882 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2024-11-22 18:08:40,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:08:40,883 INFO L225 Difference]: With dead ends: 56 [2024-11-22 18:08:40,883 INFO L226 Difference]: Without dead ends: 56 [2024-11-22 18:08:40,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 75 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2024-11-22 18:08:40,884 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 78 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:08:40,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 175 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:08:40,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-22 18:08:40,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2024-11-22 18:08:40,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 42 states have internal predecessors, (51), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-22 18:08:40,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 59 transitions. [2024-11-22 18:08:40,890 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 59 transitions. Word has length 42 [2024-11-22 18:08:40,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:08:40,890 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 59 transitions. [2024-11-22 18:08:40,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-22 18:08:40,890 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 59 transitions. [2024-11-22 18:08:40,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-22 18:08:40,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:08:40,892 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1] [2024-11-22 18:08:40,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 18:08:41,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:08:41,097 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:08:41,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:08:41,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1092704934, now seen corresponding path program 1 times [2024-11-22 18:08:41,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:08:41,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703793880] [2024-11-22 18:08:41,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:08:41,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:08:41,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:08:41,563 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-22 18:08:41,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:08:41,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703793880] [2024-11-22 18:08:41,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703793880] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:08:41,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780669815] [2024-11-22 18:08:41,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:08:41,564 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:08:41,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:08:41,567 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:08:41,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 18:08:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:08:41,713 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-22 18:08:41,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:08:41,781 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 13 treesize of output 9 [2024-11-22 18:08:41,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2024-11-22 18:08:41,898 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-22 18:08:41,898 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:08:42,052 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 20 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-22 18:08:42,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780669815] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:08:42,053 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:08:42,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2024-11-22 18:08:42,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895460092] [2024-11-22 18:08:42,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:08:42,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-22 18:08:42,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:08:42,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-22 18:08:42,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=450, Unknown=0, NotChecked=0, Total=506 [2024-11-22 18:08:42,055 INFO L87 Difference]: Start difference. First operand 49 states and 59 transitions. Second operand has 23 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 21 states have internal predecessors, (57), 3 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-22 18:08:42,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:08:42,816 INFO L93 Difference]: Finished difference Result 69 states and 82 transitions. [2024-11-22 18:08:42,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-22 18:08:42,817 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 21 states have internal predecessors, (57), 3 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) Word has length 45 [2024-11-22 18:08:42,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:08:42,819 INFO L225 Difference]: With dead ends: 69 [2024-11-22 18:08:42,819 INFO L226 Difference]: Without dead ends: 69 [2024-11-22 18:08:42,820 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=328, Invalid=1564, Unknown=0, NotChecked=0, Total=1892 [2024-11-22 18:08:42,821 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 178 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 18:08:42,821 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 418 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 18:08:42,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-22 18:08:42,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54. [2024-11-22 18:08:42,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 47 states have internal predecessors, (56), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-22 18:08:42,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2024-11-22 18:08:42,827 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 45 [2024-11-22 18:08:42,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:08:42,828 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2024-11-22 18:08:42,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 21 states have internal predecessors, (57), 3 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (7), 5 states have call predecessors, (7), 3 states have call successors, (7) [2024-11-22 18:08:42,828 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2024-11-22 18:08:42,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-22 18:08:42,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:08:42,829 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1] [2024-11-22 18:08:42,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-22 18:08:43,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:08:43,030 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:08:43,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:08:43,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1373258684, now seen corresponding path program 1 times [2024-11-22 18:08:43,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:08:43,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56126880] [2024-11-22 18:08:43,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:08:43,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:08:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:08:43,383 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-22 18:08:43,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:08:43,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56126880] [2024-11-22 18:08:43,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56126880] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:08:43,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 18:08:43,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 18:08:43,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133913303] [2024-11-22 18:08:43,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:08:43,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 18:08:43,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:08:43,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 18:08:43,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-22 18:08:43,389 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-22 18:08:43,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:08:43,554 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2024-11-22 18:08:43,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-22 18:08:43,555 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2024-11-22 18:08:43,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:08:43,556 INFO L225 Difference]: With dead ends: 57 [2024-11-22 18:08:43,556 INFO L226 Difference]: Without dead ends: 57 [2024-11-22 18:08:43,556 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-22 18:08:43,557 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 26 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:08:43,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 149 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:08:43,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-11-22 18:08:43,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2024-11-22 18:08:43,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 46 states have (on average 1.1956521739130435) internal successors, (55), 47 states have internal predecessors, (55), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2024-11-22 18:08:43,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 64 transitions. [2024-11-22 18:08:43,562 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 64 transitions. Word has length 48 [2024-11-22 18:08:43,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:08:43,562 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 64 transitions. [2024-11-22 18:08:43,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-22 18:08:43,563 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 64 transitions. [2024-11-22 18:08:43,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-22 18:08:43,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:08:43,563 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:08:43,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 18:08:43,564 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:08:43,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:08:43,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1912983903, now seen corresponding path program 2 times [2024-11-22 18:08:43,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:08:43,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883460038] [2024-11-22 18:08:43,565 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:08:43,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:08:43,599 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 18:08:43,599 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:08:44,485 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 25 proven. 7 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-22 18:08:44,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:08:44,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883460038] [2024-11-22 18:08:44,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883460038] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:08:44,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711999052] [2024-11-22 18:08:44,486 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:08:44,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:08:44,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:08:44,488 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:08:44,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 18:08:44,633 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 18:08:44,633 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:08:44,636 INFO L255 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-22 18:08:44,643 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:08:44,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:08:44,729 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 13 treesize of output 9 [2024-11-22 18:08:44,847 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:08:44,851 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 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-22 18:08:44,937 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-22 18:08:44,938 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 27 treesize of output 30 [2024-11-22 18:08:44,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 4 [2024-11-22 18:08:44,953 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-22 18:08:44,954 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-22 18:08:45,045 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 26 treesize of output 18 [2024-11-22 18:08:45,144 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 17 proven. 15 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-22 18:08:45,144 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:08:45,332 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:08:45,332 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 16 treesize of output 20 [2024-11-22 18:08:45,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711999052] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:08:45,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:08:45,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 29 [2024-11-22 18:08:45,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917319019] [2024-11-22 18:08:45,382 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:08:45,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-22 18:08:45,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:08:45,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-22 18:08:45,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=960, Unknown=0, NotChecked=0, Total=1056 [2024-11-22 18:08:45,384 INFO L87 Difference]: Start difference. First operand 54 states and 64 transitions. Second operand has 29 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 24 states have internal predecessors, (53), 5 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-22 18:08:46,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:08:46,598 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2024-11-22 18:08:46,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-22 18:08:46,598 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 24 states have internal predecessors, (53), 5 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) Word has length 49 [2024-11-22 18:08:46,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:08:46,599 INFO L225 Difference]: With dead ends: 68 [2024-11-22 18:08:46,599 INFO L226 Difference]: Without dead ends: 68 [2024-11-22 18:08:46,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=414, Invalid=2556, Unknown=0, NotChecked=0, Total=2970 [2024-11-22 18:08:46,602 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 158 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 616 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 18:08:46,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 417 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 616 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 18:08:46,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-22 18:08:46,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2024-11-22 18:08:46,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 52 states have (on average 1.1730769230769231) internal successors, (61), 53 states have internal predecessors, (61), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 18:08:46,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2024-11-22 18:08:46,615 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 49 [2024-11-22 18:08:46,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:08:46,615 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2024-11-22 18:08:46,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.8275862068965518) internal successors, (53), 24 states have internal predecessors, (53), 5 states have call successors, (6), 4 states have call predecessors, (6), 7 states have return successors, (7), 7 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-22 18:08:46,616 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2024-11-22 18:08:46,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-22 18:08:46,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:08:46,617 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:08:46,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-22 18:08:46,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:08:46,818 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:08:46,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:08:46,818 INFO L85 PathProgramCache]: Analyzing trace with hash 708604469, now seen corresponding path program 3 times [2024-11-22 18:08:46,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:08:46,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934744476] [2024-11-22 18:08:46,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 18:08:46,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:08:46,861 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-22 18:08:46,861 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:08:47,551 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 25 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-22 18:08:47,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:08:47,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934744476] [2024-11-22 18:08:47,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934744476] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:08:47,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516165979] [2024-11-22 18:08:47,552 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 18:08:47,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:08:47,552 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:08:47,555 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:08:47,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-22 18:08:47,714 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-22 18:08:47,715 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:08:47,717 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-22 18:08:47,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:08:47,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:08:47,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 18:08:47,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 18:08:47,954 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 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-22 18:08:47,964 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 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-22 18:08:48,084 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-22 18:08:48,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2024-11-22 18:08:48,109 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-22 18:08:48,109 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 28 treesize of output 31 [2024-11-22 18:08:48,136 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-22 18:08:48,136 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-22 18:08:48,518 INFO L349 Elim1Store]: treesize reduction 8, result has 86.9 percent of original size [2024-11-22 18:08:48,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 103 [2024-11-22 18:08:48,569 INFO L349 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2024-11-22 18:08:48,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 91 treesize of output 98 [2024-11-22 18:08:48,811 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-22 18:08:48,811 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:08:49,033 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:08:49,034 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 16 treesize of output 20 [2024-11-22 18:08:49,039 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:08:49,040 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 16 treesize of output 20 [2024-11-22 18:08:49,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516165979] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:08:49,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:08:49,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 29 [2024-11-22 18:08:49,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151239362] [2024-11-22 18:08:49,095 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:08:49,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-22 18:08:49,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:08:49,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-22 18:08:49,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2024-11-22 18:08:49,099 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 26 states have internal predecessors, (61), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-22 18:08:50,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:08:50,315 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2024-11-22 18:08:50,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-22 18:08:50,316 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 26 states have internal predecessors, (61), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 50 [2024-11-22 18:08:50,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:08:50,317 INFO L225 Difference]: With dead ends: 75 [2024-11-22 18:08:50,317 INFO L226 Difference]: Without dead ends: 75 [2024-11-22 18:08:50,318 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=420, Invalid=2772, Unknown=0, NotChecked=0, Total=3192 [2024-11-22 18:08:50,319 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 169 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 18:08:50,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 338 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 18:08:50,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2024-11-22 18:08:50,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 65. [2024-11-22 18:08:50,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 56 states have internal predecessors, (65), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 18:08:50,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2024-11-22 18:08:50,324 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 50 [2024-11-22 18:08:50,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:08:50,324 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2024-11-22 18:08:50,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 26 states have internal predecessors, (61), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-22 18:08:50,325 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2024-11-22 18:08:50,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-22 18:08:50,326 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:08:50,326 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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, 1, 1, 1, 1] [2024-11-22 18:08:50,334 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-22 18:08:50,526 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:08:50,527 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:08:50,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:08:50,527 INFO L85 PathProgramCache]: Analyzing trace with hash -83662975, now seen corresponding path program 1 times [2024-11-22 18:08:50,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:08:50,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740106272] [2024-11-22 18:08:50,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:08:50,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:08:50,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:08:50,829 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2024-11-22 18:08:50,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:08:50,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740106272] [2024-11-22 18:08:50,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740106272] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:08:50,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [347707248] [2024-11-22 18:08:50,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:08:50,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:08:50,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:08:50,833 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:08:50,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-22 18:08:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:08:51,001 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-22 18:08:51,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:08:51,018 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 22 treesize of output 7 [2024-11-22 18:08:51,077 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:08:51,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 32 [2024-11-22 18:08:51,105 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-22 18:08:51,105 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 18:08:51,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [347707248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 18:08:51,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 18:08:51,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 15 [2024-11-22 18:08:51,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739754632] [2024-11-22 18:08:51,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 18:08:51,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 18:08:51,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:08:51,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 18:08:51,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-11-22 18:08:51,107 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-22 18:08:51,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:08:51,246 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2024-11-22 18:08:51,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 18:08:51,247 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2024-11-22 18:08:51,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:08:51,247 INFO L225 Difference]: With dead ends: 65 [2024-11-22 18:08:51,247 INFO L226 Difference]: Without dead ends: 65 [2024-11-22 18:08:51,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2024-11-22 18:08:51,248 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 16 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 18:08:51,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 176 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 18:08:51,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-22 18:08:51,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-22 18:08:51,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 56 states have internal predecessors, (64), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 18:08:51,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2024-11-22 18:08:51,253 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 52 [2024-11-22 18:08:51,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:08:51,254 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2024-11-22 18:08:51,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-22 18:08:51,254 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2024-11-22 18:08:51,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2024-11-22 18:08:51,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:08:51,255 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:08:51,264 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-22 18:08:51,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:08:51,456 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:08:51,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:08:51,456 INFO L85 PathProgramCache]: Analyzing trace with hash -301914566, now seen corresponding path program 4 times [2024-11-22 18:08:51,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:08:51,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876404300] [2024-11-22 18:08:51,457 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 18:08:51,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:08:51,490 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 18:08:51,491 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:08:53,265 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 22 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-22 18:08:53,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:08:53,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876404300] [2024-11-22 18:08:53,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876404300] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:08:53,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526695770] [2024-11-22 18:08:53,266 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-11-22 18:08:53,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:08:53,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:08:53,268 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-22 18:08:53,270 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-22 18:08:53,437 INFO L227 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-11-22 18:08:53,437 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:08:53,445 INFO L255 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 92 conjuncts are in the unsatisfiable core [2024-11-22 18:08:53,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:08:53,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:08:53,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 18:08:53,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:08:53,558 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 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-22 18:08:53,660 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-22 18:08:53,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 24 [2024-11-22 18:08:53,684 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2024-11-22 18:08:53,685 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 21 treesize of output 29 [2024-11-22 18:08:53,775 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 0 case distinctions, treesize of input 11 treesize of output 14 [2024-11-22 18:08:53,780 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 0 case distinctions, treesize of input 11 treesize of output 14 [2024-11-22 18:08:53,885 INFO L349 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2024-11-22 18:08:53,886 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 22 treesize of output 27 [2024-11-22 18:08:53,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:08:53,908 INFO L349 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2024-11-22 18:08:53,909 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 62 treesize of output 47 [2024-11-22 18:08:53,926 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2024-11-22 18:08:53,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2024-11-22 18:08:54,223 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2024-11-22 18:08:54,311 INFO L349 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2024-11-22 18:08:54,312 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 26 [2024-11-22 18:08:54,317 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 18 proven. 30 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-22 18:08:54,317 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:08:54,514 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:08:54,514 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 46 treesize of output 45 [2024-11-22 18:08:54,521 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:08:54,521 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 36 treesize of output 40 [2024-11-22 18:08:54,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526695770] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:08:54,587 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:08:54,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 35 [2024-11-22 18:08:54,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405130808] [2024-11-22 18:08:54,588 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:08:54,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-22 18:08:54,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:08:54,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-22 18:08:54,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1438, Unknown=1, NotChecked=0, Total=1560 [2024-11-22 18:08:54,590 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand has 35 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 32 states have internal predecessors, (65), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 18:08:56,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:08:56,296 INFO L93 Difference]: Finished difference Result 82 states and 96 transitions. [2024-11-22 18:08:56,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-22 18:08:56,297 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 32 states have internal predecessors, (65), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 53 [2024-11-22 18:08:56,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:08:56,298 INFO L225 Difference]: With dead ends: 82 [2024-11-22 18:08:56,298 INFO L226 Difference]: Without dead ends: 82 [2024-11-22 18:08:56,299 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 925 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=476, Invalid=3555, Unknown=1, NotChecked=0, Total=4032 [2024-11-22 18:08:56,300 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 234 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 762 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 18:08:56,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 392 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 762 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 18:08:56,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-22 18:08:56,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 68. [2024-11-22 18:08:56,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 59 states have internal predecessors, (68), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 18:08:56,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 79 transitions. [2024-11-22 18:08:56,305 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 79 transitions. Word has length 53 [2024-11-22 18:08:56,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:08:56,306 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 79 transitions. [2024-11-22 18:08:56,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.8571428571428572) internal successors, (65), 32 states have internal predecessors, (65), 5 states have call successors, (5), 4 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 18:08:56,306 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 79 transitions. [2024-11-22 18:08:56,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-22 18:08:56,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:08:56,308 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1] [2024-11-22 18:08:56,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-22 18:08:56,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-22 18:08:56,509 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:08:56,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:08:56,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1613270677, now seen corresponding path program 1 times [2024-11-22 18:08:56,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:08:56,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520438654] [2024-11-22 18:08:56,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:08:56,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:08:56,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:08:57,450 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-22 18:08:57,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:08:57,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520438654] [2024-11-22 18:08:57,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520438654] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:08:57,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081651468] [2024-11-22 18:08:57,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:08:57,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:08:57,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:08:57,452 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:08:57,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-22 18:08:57,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:08:57,629 INFO L255 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 79 conjuncts are in the unsatisfiable core [2024-11-22 18:08:57,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:08:57,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:08:57,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:08:57,836 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 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-22 18:08:57,917 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-22 18:08:57,917 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 21 treesize of output 24 [2024-11-22 18:08:58,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-22 18:08:58,319 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-22 18:08:58,319 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 26 [2024-11-22 18:08:58,412 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-22 18:08:58,437 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-22 18:08:58,438 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:08:58,909 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:08:58,910 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 16 treesize of output 20 [2024-11-22 18:09:03,153 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:09:03,154 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 18 treesize of output 22 [2024-11-22 18:09:03,584 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 16 proven. 17 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-22 18:09:03,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081651468] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:09:03,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:09:03,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23, 23] total 57 [2024-11-22 18:09:03,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729165448] [2024-11-22 18:09:03,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:09:03,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-22 18:09:03,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:09:03,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-22 18:09:03,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=3004, Unknown=1, NotChecked=0, Total=3192 [2024-11-22 18:09:03,587 INFO L87 Difference]: Start difference. First operand 68 states and 79 transitions. Second operand has 57 states, 57 states have (on average 1.8771929824561404) internal successors, (107), 52 states have internal predecessors, (107), 4 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-22 18:09:08,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-22 18:09:10,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:09:10,052 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2024-11-22 18:09:10,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2024-11-22 18:09:10,053 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 1.8771929824561404) internal successors, (107), 52 states have internal predecessors, (107), 4 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) Word has length 54 [2024-11-22 18:09:10,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:09:10,055 INFO L225 Difference]: With dead ends: 82 [2024-11-22 18:09:10,055 INFO L226 Difference]: Without dead ends: 77 [2024-11-22 18:09:10,057 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 70 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1368 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=665, Invalid=6474, Unknown=1, NotChecked=0, Total=7140 [2024-11-22 18:09:10,058 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 192 mSDsluCounter, 670 mSDsCounter, 0 mSdLazyCounter, 1127 mSolverCounterSat, 42 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 1173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1127 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-22 18:09:10,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 696 Invalid, 1173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1127 Invalid, 4 Unknown, 0 Unchecked, 4.9s Time] [2024-11-22 18:09:10,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-22 18:09:10,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2024-11-22 18:09:10,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 60 states have (on average 1.15) internal successors, (69), 62 states have internal predecessors, (69), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 18:09:10,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2024-11-22 18:09:10,067 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 54 [2024-11-22 18:09:10,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:09:10,068 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2024-11-22 18:09:10,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 1.8771929824561404) internal successors, (107), 52 states have internal predecessors, (107), 4 states have call successors, (8), 6 states have call predecessors, (8), 8 states have return successors, (9), 7 states have call predecessors, (9), 4 states have call successors, (9) [2024-11-22 18:09:10,068 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2024-11-22 18:09:10,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-22 18:09:10,069 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:09:10,069 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 18:09:10,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-22 18:09:10,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:09:10,270 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:09:10,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:09:10,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1248708587, now seen corresponding path program 5 times [2024-11-22 18:09:10,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:09:10,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97158046] [2024-11-22 18:09:10,270 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 18:09:10,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:09:10,318 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-11-22 18:09:10,319 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:09:11,804 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 39 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 18:09:11,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:09:11,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97158046] [2024-11-22 18:09:11,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97158046] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:09:11,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [574795210] [2024-11-22 18:09:11,805 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-11-22 18:09:11,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:09:11,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:09:11,806 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:09:11,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-22 18:09:11,986 INFO L227 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2024-11-22 18:09:11,986 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:09:11,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 150 conjuncts are in the unsatisfiable core [2024-11-22 18:09:11,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:09:11,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:09:12,029 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 18 treesize of output 7 [2024-11-22 18:09:12,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:09:12,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:09:12,311 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2024-11-22 18:09:12,311 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 21 treesize of output 29 [2024-11-22 18:09:12,319 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 20 treesize of output 15 [2024-11-22 18:09:12,474 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 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-22 18:09:12,482 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 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-22 18:09:12,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:09:12,662 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 53 treesize of output 36 [2024-11-22 18:09:12,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:09:12,681 INFO L349 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2024-11-22 18:09:12,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2024-11-22 18:09:12,690 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 24 treesize of output 19 [2024-11-22 18:09:12,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:09:12,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-22 18:09:12,861 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 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-22 18:09:12,869 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 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-22 18:09:13,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:09:13,037 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2024-11-22 18:09:13,037 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 129 treesize of output 76 [2024-11-22 18:09:13,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:09:13,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:09:13,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:09:13,048 INFO L349 Elim1Store]: treesize reduction 4, result has 80.0 percent of original size [2024-11-22 18:09:13,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 29 [2024-11-22 18:09:13,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:09:13,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:09:13,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:09:13,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2024-11-22 18:09:13,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2024-11-22 18:09:13,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:09:13,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:09:13,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 18:09:13,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 10 [2024-11-22 18:09:13,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 17 [2024-11-22 18:09:14,024 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 21 proven. 38 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-22 18:09:14,024 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:09:14,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:09:14,540 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 171 treesize of output 156 [2024-11-22 18:09:14,549 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:09:14,549 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 150 treesize of output 138 [2024-11-22 18:09:14,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [574795210] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:09:14,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:09:14,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 47 [2024-11-22 18:09:14,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403242211] [2024-11-22 18:09:14,657 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:09:14,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2024-11-22 18:09:14,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:09:14,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2024-11-22 18:09:14,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2889, Unknown=0, NotChecked=0, Total=3080 [2024-11-22 18:09:14,659 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand has 47 states, 47 states have (on average 1.7659574468085106) internal successors, (83), 42 states have internal predecessors, (83), 6 states have call successors, (7), 5 states have call predecessors, (7), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-22 18:09:18,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:09:18,225 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2024-11-22 18:09:18,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-22 18:09:18,225 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 1.7659574468085106) internal successors, (83), 42 states have internal predecessors, (83), 6 states have call successors, (7), 5 states have call predecessors, (7), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 56 [2024-11-22 18:09:18,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:09:18,226 INFO L225 Difference]: With dead ends: 88 [2024-11-22 18:09:18,227 INFO L226 Difference]: Without dead ends: 86 [2024-11-22 18:09:18,229 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2028 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=594, Invalid=7238, Unknown=0, NotChecked=0, Total=7832 [2024-11-22 18:09:18,231 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 167 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 1442 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 1442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:09:18,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 360 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 1442 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-22 18:09:18,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-22 18:09:18,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 69. [2024-11-22 18:09:18,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 60 states have internal predecessors, (65), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 18:09:18,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2024-11-22 18:09:18,240 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 56 [2024-11-22 18:09:18,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:09:18,240 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2024-11-22 18:09:18,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 1.7659574468085106) internal successors, (83), 42 states have internal predecessors, (83), 6 states have call successors, (7), 5 states have call predecessors, (7), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-22 18:09:18,241 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2024-11-22 18:09:18,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-22 18:09:18,241 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:09:18,241 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2024-11-22 18:09:18,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-22 18:09:18,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-22 18:09:18,442 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:09:18,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:09:18,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1967540198, now seen corresponding path program 2 times [2024-11-22 18:09:18,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:09:18,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713446190] [2024-11-22 18:09:18,443 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:09:18,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:09:18,471 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 18:09:18,471 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:09:19,550 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 10 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2024-11-22 18:09:19,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:09:19,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713446190] [2024-11-22 18:09:19,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713446190] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:09:19,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526968691] [2024-11-22 18:09:19,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:09:19,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:09:19,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:09:19,552 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:09:19,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-22 18:09:19,747 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 18:09:19,747 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:09:19,751 INFO L255 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-11-22 18:09:19,755 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:09:19,769 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 18 treesize of output 7 [2024-11-22 18:09:19,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:09:19,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:09:19,902 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~head~0.offset 0) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (or (exists ((|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#1_BEFORE_CALL_8| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse0) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse1 (select |c_#memory_int#1| .cse1))) (= .cse1 c_~head~0.base)))) (= (select (select |c_#memory_int#1| .cse0) 0) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0)) is different from false [2024-11-22 18:09:19,906 WARN L873 $PredicateComparison]: unable to prove that (and (= c_~head~0.offset 0) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (or (exists ((|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#1_BEFORE_CALL_8| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse0) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse1 (select |c_#memory_int#1| .cse1))) (= .cse1 c_~head~0.base)))) (= (select (select |c_#memory_int#1| .cse0) 0) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0)) is different from true [2024-11-22 18:09:20,057 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_search_list_~l#1.offset| 0) (= c_~head~0.offset 0) (= |c_ULTIMATE.start_search_list_~l#1.base| c_~head~0.base) (= 2 |c_ULTIMATE.start_search_list_~k#1|) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (or (exists ((|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#1_BEFORE_CALL_8| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse0) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse1 (select |c_#memory_int#1| .cse1))) (= .cse1 c_~head~0.base)))) (= (select (select |c_#memory_int#1| .cse0) 0) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0)) is different from false [2024-11-22 18:09:20,061 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_search_list_~l#1.offset| 0) (= c_~head~0.offset 0) (= |c_ULTIMATE.start_search_list_~l#1.base| c_~head~0.base) (= 2 |c_ULTIMATE.start_search_list_~k#1|) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (or (exists ((|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#1_BEFORE_CALL_8| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse0) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse1 (select |c_#memory_int#1| .cse1))) (= .cse1 c_~head~0.base)))) (= (select (select |c_#memory_int#1| .cse0) 0) 1))) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0)) is different from true [2024-11-22 18:09:20,151 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (and (= c_~head~0.offset 0) (= |c_ULTIMATE.start_search_list_~l#1.base| .cse0) (= 2 |c_ULTIMATE.start_search_list_~k#1|) (or (exists ((|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#1_BEFORE_CALL_8| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse0) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse1 (select |c_#memory_int#1| .cse1))) (= .cse1 c_~head~0.base)))) (= (select (select |c_#memory_int#1| .cse0) 0) 1)) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0))) is different from false [2024-11-22 18:09:20,154 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (and (= c_~head~0.offset 0) (= |c_ULTIMATE.start_search_list_~l#1.base| .cse0) (= 2 |c_ULTIMATE.start_search_list_~k#1|) (or (exists ((|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#1_BEFORE_CALL_8| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse0) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse1 (select |c_#memory_int#1| .cse1))) (= .cse1 c_~head~0.base)))) (= (select (select |c_#memory_int#1| .cse0) 0) 1)) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0))) is different from true [2024-11-22 18:09:20,237 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (and (= c_~head~0.offset 0) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (and (= |c_ULTIMATE.start_search_list_~l#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1)) (= |c_ULTIMATE.start_search_list_~l#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1))))) (= 2 |c_ULTIMATE.start_search_list_~k#1|) (or (exists ((|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int#1_BEFORE_CALL_8| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse0) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse2 (select |c_#memory_int#1| .cse2))) (= .cse2 c_~head~0.base)))) (= (select (select |c_#memory_int#1| .cse0) 0) 1)) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0))) is different from false [2024-11-22 18:09:20,241 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (and (= c_~head~0.offset 0) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (and (= |c_ULTIMATE.start_search_list_~l#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1)) (= |c_ULTIMATE.start_search_list_~l#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1))))) (= 2 |c_ULTIMATE.start_search_list_~k#1|) (or (exists ((|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int#1_BEFORE_CALL_8| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse0) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse2 (select |c_#memory_int#1| .cse2))) (= .cse2 c_~head~0.base)))) (= (select (select |c_#memory_int#1| .cse0) 0) 1)) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0))) is different from true [2024-11-22 18:09:20,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:09:20,369 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 33 treesize of output 33 [2024-11-22 18:09:20,391 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (and (= c_~head~0.offset 0) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (and (= |c_ULTIMATE.start_search_list_~l#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1)) (= |c_ULTIMATE.start_search_list_~l#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1))))) (or (not (= |c_ULTIMATE.start_search_list_~l#1.base| .cse0)) (not (= |c_ULTIMATE.start_search_list_~l#1.offset| 0)) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int#1_BEFORE_CALL_8| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse0) 0) 1) (= 2 (select (select |#memory_int#1| |c_ULTIMATE.start_search_list_~l#1.base|) 0)) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse2 (select |#memory_int#1| .cse2))) (= .cse2 c_~head~0.base)))) |c_ULTIMATE.start_search_list_#t~short32#1|) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0))) is different from false [2024-11-22 18:09:20,394 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (and (= c_~head~0.offset 0) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (and (= |c_ULTIMATE.start_search_list_~l#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1)) (= |c_ULTIMATE.start_search_list_~l#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1))))) (or (not (= |c_ULTIMATE.start_search_list_~l#1.base| .cse0)) (not (= |c_ULTIMATE.start_search_list_~l#1.offset| 0)) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int#1_BEFORE_CALL_8| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse0) 0) 1) (= 2 (select (select |#memory_int#1| |c_ULTIMATE.start_search_list_~l#1.base|) 0)) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse2 (select |#memory_int#1| .cse2))) (= .cse2 c_~head~0.base)))) |c_ULTIMATE.start_search_list_#t~short32#1|) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0))) is different from true [2024-11-22 18:09:20,440 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (and (= c_~head~0.offset 0) (or (not (= |c_ULTIMATE.start_search_list_~l#1.base| .cse0)) (not (= |c_ULTIMATE.start_search_list_~l#1.offset| 0)) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#1_BEFORE_CALL_8| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse0) 0) 1) (= 2 (select (select |#memory_int#1| |c_ULTIMATE.start_search_list_~l#1.base|) 0)) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse1 (select |#memory_int#1| .cse1))) (= .cse1 c_~head~0.base))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (and (= |c_ULTIMATE.start_search_list_~l#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse2)) (= |c_ULTIMATE.start_search_list_~l#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse2))))) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0))) is different from false [2024-11-22 18:09:20,443 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (and (= c_~head~0.offset 0) (or (not (= |c_ULTIMATE.start_search_list_~l#1.base| .cse0)) (not (= |c_ULTIMATE.start_search_list_~l#1.offset| 0)) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#1_BEFORE_CALL_8| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse0) 0) 1) (= 2 (select (select |#memory_int#1| |c_ULTIMATE.start_search_list_~l#1.base|) 0)) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse1 (select |#memory_int#1| .cse1))) (= .cse1 c_~head~0.base))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (and (= |c_ULTIMATE.start_search_list_~l#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse2)) (= |c_ULTIMATE.start_search_list_~l#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse2))))) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0))) is different from true [2024-11-22 18:09:20,482 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (and (= c_~head~0.offset 0) (or (not (= 0 |c_ULTIMATE.start_search_list_#res#1.offset|)) (not (= .cse0 |c_ULTIMATE.start_search_list_#res#1.base|)) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#1_BEFORE_CALL_8| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse0) 0) 1) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse1 (select |#memory_int#1| .cse1))) (= .cse1 c_~head~0.base) (= (select (select |#memory_int#1| |c_ULTIMATE.start_search_list_#res#1.base|) 0) 2))))) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse2) |c_ULTIMATE.start_search_list_#res#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse2) |c_ULTIMATE.start_search_list_#res#1.offset|)))))) is different from false [2024-11-22 18:09:20,485 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (and (= c_~head~0.offset 0) (or (not (= 0 |c_ULTIMATE.start_search_list_#res#1.offset|)) (not (= .cse0 |c_ULTIMATE.start_search_list_#res#1.base|)) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_#memory_int#1_BEFORE_CALL_8| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse0) 0) 1) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse1 (select |#memory_int#1| .cse1))) (= .cse1 c_~head~0.base) (= (select (select |#memory_int#1| |c_ULTIMATE.start_search_list_#res#1.base|) 0) 2))))) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse2) |c_ULTIMATE.start_search_list_#res#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse2) |c_ULTIMATE.start_search_list_#res#1.offset|)))))) is different from true [2024-11-22 18:09:20,546 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~head~0.offset 0) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse5 (select |c_#memory_$Pointer$#1.base| .cse1))) (or (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse4 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse0 (select .cse5 .cse4))) (and (= .cse0 |c_ULTIMATE.start_main_~temp~0#1.base|) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int#1_BEFORE_CALL_8| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse1) 0) 1) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse2 (select |#memory_int#1| .cse2))) (= (select (select |#memory_int#1| .cse0) 0) 2) (= .cse2 c_~head~0.base)))) (= (select .cse3 .cse4) |c_ULTIMATE.start_main_~temp~0#1.offset|))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse6 (select .cse3 .cse7))) (and (not (= .cse6 0)) (= (select .cse5 .cse7) |c_ULTIMATE.start_main_~temp~0#1.base|) (= .cse6 |c_ULTIMATE.start_main_~temp~0#1.offset|))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse9 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse8 (select .cse5 .cse9))) (and (= .cse8 |c_ULTIMATE.start_main_~temp~0#1.base|) (= (select .cse3 .cse9) |c_ULTIMATE.start_main_~temp~0#1.offset|) (not (= .cse1 .cse8)))))))))) is different from false [2024-11-22 18:09:20,551 WARN L873 $PredicateComparison]: unable to prove that (and (= c_~head~0.offset 0) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse5 (select |c_#memory_$Pointer$#1.base| .cse1))) (or (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse4 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse0 (select .cse5 .cse4))) (and (= .cse0 |c_ULTIMATE.start_main_~temp~0#1.base|) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int#1_BEFORE_CALL_8| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse1) 0) 1) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse2 (select |#memory_int#1| .cse2))) (= (select (select |#memory_int#1| .cse0) 0) 2) (= .cse2 c_~head~0.base)))) (= (select .cse3 .cse4) |c_ULTIMATE.start_main_~temp~0#1.offset|))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse7 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse6 (select .cse3 .cse7))) (and (not (= .cse6 0)) (= (select .cse5 .cse7) |c_ULTIMATE.start_main_~temp~0#1.base|) (= .cse6 |c_ULTIMATE.start_main_~temp~0#1.offset|))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse9 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse8 (select .cse5 .cse9))) (and (= .cse8 |c_ULTIMATE.start_main_~temp~0#1.base|) (= (select .cse3 .cse9) |c_ULTIMATE.start_main_~temp~0#1.offset|) (not (= .cse1 .cse8)))))))))) is different from true [2024-11-22 18:09:20,677 WARN L851 $PredicateComparison]: unable to prove that (and (= c_~head~0.offset 0) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| c_~head~0.base) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.offset| 0) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse5)) (.cse1 (select |c_#memory_$Pointer$#1.base| .cse5))) (or (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse0 (select .cse3 .cse2))) (and (= .cse0 |c_ULTIMATE.start_delete_list_~l#1.offset|) (not (= .cse0 0)) (= (select .cse1 .cse2) |c_ULTIMATE.start_delete_list_~l#1.base|))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse4 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse7 (select .cse1 .cse4))) (and (= (select .cse3 .cse4) |c_ULTIMATE.start_delete_list_~l#1.offset|) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_#memory_int#1_BEFORE_CALL_8| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse5) 0) 1) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse6 (select |#memory_int#1| .cse6))) (= (select (select |#memory_int#1| .cse7) 0) 2) (= .cse6 c_~head~0.base)))) (= .cse7 |c_ULTIMATE.start_delete_list_~l#1.base|))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse9 (select .cse1 .cse8))) (and (= (select .cse3 .cse8) |c_ULTIMATE.start_delete_list_~l#1.offset|) (not (= .cse5 .cse9)) (= .cse9 |c_ULTIMATE.start_delete_list_~l#1.base|))))))))) is different from false [2024-11-22 18:09:20,681 WARN L873 $PredicateComparison]: unable to prove that (and (= c_~head~0.offset 0) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| c_~head~0.base) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.offset| 0) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse5)) (.cse1 (select |c_#memory_$Pointer$#1.base| .cse5))) (or (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse0 (select .cse3 .cse2))) (and (= .cse0 |c_ULTIMATE.start_delete_list_~l#1.offset|) (not (= .cse0 0)) (= (select .cse1 .cse2) |c_ULTIMATE.start_delete_list_~l#1.base|))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse4 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse7 (select .cse1 .cse4))) (and (= (select .cse3 .cse4) |c_ULTIMATE.start_delete_list_~l#1.offset|) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_#memory_int#1_BEFORE_CALL_8| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse5) 0) 1) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse6 (select |#memory_int#1| .cse6))) (= (select (select |#memory_int#1| .cse7) 0) 2) (= .cse6 c_~head~0.base)))) (= .cse7 |c_ULTIMATE.start_delete_list_~l#1.base|))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse9 (select .cse1 .cse8))) (and (= (select .cse3 .cse8) |c_ULTIMATE.start_delete_list_~l#1.offset|) (not (= .cse5 .cse9)) (= .cse9 |c_ULTIMATE.start_delete_list_~l#1.base|))))))))) is different from true [2024-11-22 18:09:20,748 WARN L851 $PredicateComparison]: unable to prove that (and (or (not (= |c_ULTIMATE.start_delete_list_~l#1.offset| 0)) (not (= |c_ULTIMATE.start_delete_list_~l#1.base| c_~head~0.base))) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| c_~head~0.base) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.offset| 0) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse5)) (.cse1 (select |c_#memory_$Pointer$#1.base| .cse5))) (or (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse0 (select .cse3 .cse2))) (and (= .cse0 |c_ULTIMATE.start_delete_list_~l#1.offset|) (not (= .cse0 0)) (= (select .cse1 .cse2) |c_ULTIMATE.start_delete_list_~l#1.base|))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse4 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse7 (select .cse1 .cse4))) (and (= (select .cse3 .cse4) |c_ULTIMATE.start_delete_list_~l#1.offset|) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_#memory_int#1_BEFORE_CALL_8| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse5) 0) 1) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse6 (select |#memory_int#1| .cse6))) (= (select (select |#memory_int#1| .cse7) 0) 2) (= .cse6 c_~head~0.base)))) (= .cse7 |c_ULTIMATE.start_delete_list_~l#1.base|))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse9 (select .cse1 .cse8))) (and (= (select .cse3 .cse8) |c_ULTIMATE.start_delete_list_~l#1.offset|) (not (= .cse5 .cse9)) (= .cse9 |c_ULTIMATE.start_delete_list_~l#1.base|))))))))) is different from false [2024-11-22 18:09:20,752 WARN L873 $PredicateComparison]: unable to prove that (and (or (not (= |c_ULTIMATE.start_delete_list_~l#1.offset| 0)) (not (= |c_ULTIMATE.start_delete_list_~l#1.base| c_~head~0.base))) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| c_~head~0.base) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.offset| 0) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse5)) (.cse1 (select |c_#memory_$Pointer$#1.base| .cse5))) (or (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse0 (select .cse3 .cse2))) (and (= .cse0 |c_ULTIMATE.start_delete_list_~l#1.offset|) (not (= .cse0 0)) (= (select .cse1 .cse2) |c_ULTIMATE.start_delete_list_~l#1.base|))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse4 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse7 (select .cse1 .cse4))) (and (= (select .cse3 .cse4) |c_ULTIMATE.start_delete_list_~l#1.offset|) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_#memory_int#1_BEFORE_CALL_8| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse5) 0) 1) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse6 (select |#memory_int#1| .cse6))) (= (select (select |#memory_int#1| .cse7) 0) 2) (= .cse6 c_~head~0.base)))) (= .cse7 |c_ULTIMATE.start_delete_list_~l#1.base|))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse9 (select .cse1 .cse8))) (and (= (select .cse3 .cse8) |c_ULTIMATE.start_delete_list_~l#1.offset|) (not (= .cse5 .cse9)) (= .cse9 |c_ULTIMATE.start_delete_list_~l#1.base|))))))))) is different from true [2024-11-22 18:09:20,849 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:09:20,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 167 treesize of output 152 [2024-11-22 18:09:20,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:09:20,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 93 treesize of output 125 [2024-11-22 18:09:24,697 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 9 not checked. [2024-11-22 18:09:24,697 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:09:25,346 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 75 treesize of output 63 [2024-11-22 18:09:25,352 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 28 treesize of output 22 [2024-11-22 18:09:25,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526968691] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:09:25,431 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:09:25,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 31 [2024-11-22 18:09:25,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825334416] [2024-11-22 18:09:25,431 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:09:25,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-22 18:09:25,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:09:25,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-22 18:09:25,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=969, Unknown=20, NotChecked=710, Total=1806 [2024-11-22 18:09:25,432 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 31 states, 31 states have (on average 2.0) internal successors, (62), 30 states have internal predecessors, (62), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 18:09:25,709 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse0 (select |c_#memory_int#1| .cse2)) (.cse3 (= .cse1 0))) (and (or (= (select .cse0 .cse1) 1) (and (= .cse2 c_~head~0.base) .cse3)) (= c_~head~0.offset 0) (or (exists ((|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int#1_BEFORE_CALL_8| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse2) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse4 (select |c_#memory_int#1| .cse4))) (= .cse4 c_~head~0.base)))) (= (select .cse0 0) 1)) .cse3))) is different from false [2024-11-22 18:09:25,711 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse0 (select |c_#memory_int#1| .cse2)) (.cse3 (= .cse1 0))) (and (or (= (select .cse0 .cse1) 1) (and (= .cse2 c_~head~0.base) .cse3)) (= c_~head~0.offset 0) (or (exists ((|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int#1_BEFORE_CALL_8| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse2) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse4 (select |c_#memory_int#1| .cse4))) (= .cse4 c_~head~0.base)))) (= (select .cse0 0) 1)) .cse3))) is different from true [2024-11-22 18:09:25,713 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse2 (select |c_#memory_int#1| .cse0)) (.cse1 (= .cse3 0))) (and (= |c_ULTIMATE.start_search_list_~l#1.offset| 0) (= c_~head~0.offset 0) (or (and (= .cse0 c_~head~0.base) .cse1) (not (= (select .cse2 .cse3) |c_ULTIMATE.start_search_list_~k#1|))) (= |c_ULTIMATE.start_search_list_~l#1.base| c_~head~0.base) (= 2 |c_ULTIMATE.start_search_list_~k#1|) (or (exists ((|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int#1_BEFORE_CALL_8| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse0) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse4 (select |c_#memory_int#1| .cse4))) (= .cse4 c_~head~0.base)))) (= (select .cse2 0) 1)) .cse1))) is different from false [2024-11-22 18:09:25,715 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse2 (select |c_#memory_int#1| .cse0)) (.cse1 (= .cse3 0))) (and (= |c_ULTIMATE.start_search_list_~l#1.offset| 0) (= c_~head~0.offset 0) (or (and (= .cse0 c_~head~0.base) .cse1) (not (= (select .cse2 .cse3) |c_ULTIMATE.start_search_list_~k#1|))) (= |c_ULTIMATE.start_search_list_~l#1.base| c_~head~0.base) (= 2 |c_ULTIMATE.start_search_list_~k#1|) (or (exists ((|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int#1_BEFORE_CALL_8| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse0) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse4 (select |c_#memory_int#1| .cse4))) (= .cse4 c_~head~0.base)))) (= (select .cse2 0) 1)) .cse1))) is different from true [2024-11-22 18:09:25,718 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse2 (select |c_#memory_int#1| .cse0)) (.cse1 (= .cse3 0))) (and (= c_~head~0.offset 0) (= |c_ULTIMATE.start_search_list_~l#1.base| .cse0) (or (and (= .cse0 c_~head~0.base) .cse1) (not (= (select .cse2 .cse3) |c_ULTIMATE.start_search_list_~k#1|))) (= 2 |c_ULTIMATE.start_search_list_~k#1|) (or (exists ((|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int#1_BEFORE_CALL_8| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse0) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse4 (select |c_#memory_int#1| .cse4))) (= .cse4 c_~head~0.base)))) (= (select .cse2 0) 1)) .cse1))) is different from false [2024-11-22 18:09:25,721 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse2 (select |c_#memory_int#1| .cse0)) (.cse1 (= .cse3 0))) (and (= c_~head~0.offset 0) (= |c_ULTIMATE.start_search_list_~l#1.base| .cse0) (or (and (= .cse0 c_~head~0.base) .cse1) (not (= (select .cse2 .cse3) |c_ULTIMATE.start_search_list_~k#1|))) (= 2 |c_ULTIMATE.start_search_list_~k#1|) (or (exists ((|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int#1_BEFORE_CALL_8| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse0) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse4 (select |c_#memory_int#1| .cse4))) (= .cse4 c_~head~0.base)))) (= (select .cse2 0) 1)) .cse1))) is different from true [2024-11-22 18:09:25,724 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4))) (let ((.cse7 (= .cse3 0)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse0 (= |c_ULTIMATE.start_search_list_~l#1.base| .cse5)) (.cse1 (and (= .cse5 c_~head~0.base) .cse7)) (.cse4 (select |c_#memory_int#1| .cse5))) (and (or (not .cse0) .cse1 (not (let ((.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_search_list_~l#1.base|))) (= (select .cse2 .cse3) (select .cse2 |c_ULTIMATE.start_search_list_~l#1.offset|)))) |c_ULTIMATE.start_search_list_#t~short32#1|) (= c_~head~0.offset 0) .cse0 (or .cse1 (not (= (select .cse4 .cse3) |c_ULTIMATE.start_search_list_~k#1|))) (= 2 |c_ULTIMATE.start_search_list_~k#1|) (or (exists ((|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_#memory_int#1_BEFORE_CALL_8| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse5) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse6 (select |c_#memory_int#1| .cse6))) (= .cse6 c_~head~0.base)))) (= (select .cse4 0) 1)) .cse7)))) is different from false [2024-11-22 18:09:25,726 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4))) (let ((.cse7 (= .cse3 0)) (.cse5 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse0 (= |c_ULTIMATE.start_search_list_~l#1.base| .cse5)) (.cse1 (and (= .cse5 c_~head~0.base) .cse7)) (.cse4 (select |c_#memory_int#1| .cse5))) (and (or (not .cse0) .cse1 (not (let ((.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_search_list_~l#1.base|))) (= (select .cse2 .cse3) (select .cse2 |c_ULTIMATE.start_search_list_~l#1.offset|)))) |c_ULTIMATE.start_search_list_#t~short32#1|) (= c_~head~0.offset 0) .cse0 (or .cse1 (not (= (select .cse4 .cse3) |c_ULTIMATE.start_search_list_~k#1|))) (= 2 |c_ULTIMATE.start_search_list_~k#1|) (or (exists ((|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_#memory_int#1_BEFORE_CALL_8| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse5) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse6 (select |c_#memory_int#1| .cse6))) (= .cse6 c_~head~0.base)))) (= (select .cse4 0) 1)) .cse7)))) is different from true [2024-11-22 18:09:25,729 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse3 (select |c_#memory_int#1| .cse0)) (.cse2 (= .cse4 0))) (and (= c_~head~0.offset 0) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (and (= |c_ULTIMATE.start_search_list_~l#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1)) (= |c_ULTIMATE.start_search_list_~l#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1))))) (or (and (= .cse0 c_~head~0.base) .cse2) (not (= (select .cse3 .cse4) |c_ULTIMATE.start_search_list_~k#1|))) (= 2 |c_ULTIMATE.start_search_list_~k#1|) (or (exists ((|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_#memory_int#1_BEFORE_CALL_8| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse0) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse5 (select |c_#memory_int#1| .cse5))) (= .cse5 c_~head~0.base)))) (= (select .cse3 0) 1)) .cse2))) is different from false [2024-11-22 18:09:25,730 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse3 (select |c_#memory_int#1| .cse0)) (.cse2 (= .cse4 0))) (and (= c_~head~0.offset 0) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse1 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (and (= |c_ULTIMATE.start_search_list_~l#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse0) .cse1)) (= |c_ULTIMATE.start_search_list_~l#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse0) .cse1))))) (or (and (= .cse0 c_~head~0.base) .cse2) (not (= (select .cse3 .cse4) |c_ULTIMATE.start_search_list_~k#1|))) (= 2 |c_ULTIMATE.start_search_list_~k#1|) (or (exists ((|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse5 (@diff |v_#memory_int#1_BEFORE_CALL_8| |c_#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse0) 0) 1) (= |c_#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse5 (select |c_#memory_int#1| .cse5))) (= .cse5 c_~head~0.base)))) (= (select .cse3 0) 1)) .cse2))) is different from true [2024-11-22 18:09:25,734 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4)) (.cse7 (= .cse3 0))) (let ((.cse1 (and (= .cse4 c_~head~0.base) .cse7)) (.cse0 (not (= |c_ULTIMATE.start_search_list_~l#1.base| .cse4)))) (and (or .cse0 .cse1 (not (let ((.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_search_list_~l#1.base|))) (= (select .cse2 .cse3) (select .cse2 |c_ULTIMATE.start_search_list_~l#1.offset|)))) |c_ULTIMATE.start_search_list_#t~short32#1|) (= c_~head~0.offset 0) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (and (= |c_ULTIMATE.start_search_list_~l#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse5)) (= |c_ULTIMATE.start_search_list_~l#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse5))))) (or .cse1 (not (= (select (select |c_#memory_int#1| .cse4) .cse3) |c_ULTIMATE.start_search_list_~k#1|))) (or .cse0 (not (= |c_ULTIMATE.start_search_list_~l#1.offset| 0)) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_#memory_int#1_BEFORE_CALL_8| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse4) 0) 1) (= 2 (select (select |#memory_int#1| |c_ULTIMATE.start_search_list_~l#1.base|) 0)) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse6 (select |#memory_int#1| .cse6))) (= .cse6 c_~head~0.base)))) |c_ULTIMATE.start_search_list_#t~short32#1|) .cse7)))) is different from false [2024-11-22 18:09:25,736 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4))) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4)) (.cse7 (= .cse3 0))) (let ((.cse1 (and (= .cse4 c_~head~0.base) .cse7)) (.cse0 (not (= |c_ULTIMATE.start_search_list_~l#1.base| .cse4)))) (and (or .cse0 .cse1 (not (let ((.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_search_list_~l#1.base|))) (= (select .cse2 .cse3) (select .cse2 |c_ULTIMATE.start_search_list_~l#1.offset|)))) |c_ULTIMATE.start_search_list_#t~short32#1|) (= c_~head~0.offset 0) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse5 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (and (= |c_ULTIMATE.start_search_list_~l#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse4) .cse5)) (= |c_ULTIMATE.start_search_list_~l#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse4) .cse5))))) (or .cse1 (not (= (select (select |c_#memory_int#1| .cse4) .cse3) |c_ULTIMATE.start_search_list_~k#1|))) (or .cse0 (not (= |c_ULTIMATE.start_search_list_~l#1.offset| 0)) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_#memory_int#1_BEFORE_CALL_8| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse4) 0) 1) (= 2 (select (select |#memory_int#1| |c_ULTIMATE.start_search_list_~l#1.base|) 0)) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse6 (select |#memory_int#1| .cse6))) (= .cse6 c_~head~0.base)))) |c_ULTIMATE.start_search_list_#t~short32#1|) .cse7)))) is different from true [2024-11-22 18:09:25,740 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse0 (not (= |c_ULTIMATE.start_search_list_~l#1.base| .cse1))) (.cse4 (= .cse6 0))) (and (= c_~head~0.offset 0) (or .cse0 (not (= |c_ULTIMATE.start_search_list_~l#1.offset| 0)) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int#1_BEFORE_CALL_8| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse1) 0) 1) (= 2 (select (select |#memory_int#1| |c_ULTIMATE.start_search_list_~l#1.base|) 0)) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse2 (select |#memory_int#1| .cse2))) (= .cse2 c_~head~0.base))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (and (= |c_ULTIMATE.start_search_list_~l#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse3)) (= |c_ULTIMATE.start_search_list_~l#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse3))))) (or .cse0 (and (= .cse1 c_~head~0.base) .cse4) (not (let ((.cse5 (select |c_#memory_int#1| |c_ULTIMATE.start_search_list_~l#1.base|))) (= (select .cse5 .cse6) (select .cse5 |c_ULTIMATE.start_search_list_~l#1.offset|))))) .cse4))) is different from false [2024-11-22 18:09:25,742 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse0 (not (= |c_ULTIMATE.start_search_list_~l#1.base| .cse1))) (.cse4 (= .cse6 0))) (and (= c_~head~0.offset 0) (or .cse0 (not (= |c_ULTIMATE.start_search_list_~l#1.offset| 0)) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int#1_BEFORE_CALL_8| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse1) 0) 1) (= 2 (select (select |#memory_int#1| |c_ULTIMATE.start_search_list_~l#1.base|) 0)) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse2 (select |#memory_int#1| .cse2))) (= .cse2 c_~head~0.base))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse3 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (and (= |c_ULTIMATE.start_search_list_~l#1.base| (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse3)) (= |c_ULTIMATE.start_search_list_~l#1.offset| (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse3))))) (or .cse0 (and (= .cse1 c_~head~0.base) .cse4) (not (let ((.cse5 (select |c_#memory_int#1| |c_ULTIMATE.start_search_list_~l#1.base|))) (= (select .cse5 .cse6) (select .cse5 |c_ULTIMATE.start_search_list_~l#1.offset|))))) .cse4))) is different from true [2024-11-22 18:09:25,745 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse0 (not (= .cse1 |c_ULTIMATE.start_search_list_#res#1.base|))) (.cse3 (= .cse5 0))) (and (= c_~head~0.offset 0) (or (not (= 0 |c_ULTIMATE.start_search_list_#res#1.offset|)) .cse0 (exists ((|#memory_int#1| (Array Int (Array Int Int))) (|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int#1_BEFORE_CALL_8| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse1) 0) 1) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse2 (select |#memory_int#1| .cse2))) (= .cse2 c_~head~0.base) (= (select (select |#memory_int#1| |c_ULTIMATE.start_search_list_#res#1.base|) 0) 2))))) (or .cse0 (and (= .cse1 c_~head~0.base) .cse3) (not (let ((.cse4 (select |c_#memory_int#1| |c_ULTIMATE.start_search_list_#res#1.base|))) (= (select .cse4 |c_ULTIMATE.start_search_list_#res#1.offset|) (select .cse4 .cse5))))) .cse3 (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse6) |c_ULTIMATE.start_search_list_#res#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse6) |c_ULTIMATE.start_search_list_#res#1.offset|))))))) is different from false [2024-11-22 18:09:25,747 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse0 (not (= .cse1 |c_ULTIMATE.start_search_list_#res#1.base|))) (.cse3 (= .cse5 0))) (and (= c_~head~0.offset 0) (or (not (= 0 |c_ULTIMATE.start_search_list_#res#1.offset|)) .cse0 (exists ((|#memory_int#1| (Array Int (Array Int Int))) (|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse2 (@diff |v_#memory_int#1_BEFORE_CALL_8| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse1) 0) 1) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse2 (select |#memory_int#1| .cse2))) (= .cse2 c_~head~0.base) (= (select (select |#memory_int#1| |c_ULTIMATE.start_search_list_#res#1.base|) 0) 2))))) (or .cse0 (and (= .cse1 c_~head~0.base) .cse3) (not (let ((.cse4 (select |c_#memory_int#1| |c_ULTIMATE.start_search_list_#res#1.base|))) (= (select .cse4 |c_ULTIMATE.start_search_list_#res#1.offset|) (select .cse4 .cse5))))) .cse3 (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (and (= (select (select |c_#memory_$Pointer$#1.base| .cse1) .cse6) |c_ULTIMATE.start_search_list_#res#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| .cse1) .cse6) |c_ULTIMATE.start_search_list_#res#1.offset|))))))) is different from true [2024-11-22 18:09:25,751 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4))) (let ((.cse2 (= .cse0 0)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (and (= c_~head~0.offset 0) (or (not (= .cse0 |c_ULTIMATE.start_main_~temp~0#1.offset|)) (and (= .cse1 c_~head~0.base) .cse2) (not (= .cse1 |c_ULTIMATE.start_main_~temp~0#1.base|))) .cse2 (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse7 (select |c_#memory_$Pointer$#1.base| .cse1))) (or (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse3 (select .cse7 .cse6))) (and (= .cse3 |c_ULTIMATE.start_main_~temp~0#1.base|) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int#1_BEFORE_CALL_8| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse1) 0) 1) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse4 (select |#memory_int#1| .cse4))) (= (select (select |#memory_int#1| .cse3) 0) 2) (= .cse4 c_~head~0.base)))) (= (select .cse5 .cse6) |c_ULTIMATE.start_main_~temp~0#1.offset|))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse9 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse8 (select .cse5 .cse9))) (and (not (= .cse8 0)) (= (select .cse7 .cse9) |c_ULTIMATE.start_main_~temp~0#1.base|) (= .cse8 |c_ULTIMATE.start_main_~temp~0#1.offset|))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse10 (select .cse7 .cse11))) (and (= .cse10 |c_ULTIMATE.start_main_~temp~0#1.base|) (= (select .cse5 .cse11) |c_ULTIMATE.start_main_~temp~0#1.offset|) (not (= .cse1 .cse10))))))))))) is different from false [2024-11-22 18:09:25,753 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4))) (let ((.cse2 (= .cse0 0)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (and (= c_~head~0.offset 0) (or (not (= .cse0 |c_ULTIMATE.start_main_~temp~0#1.offset|)) (and (= .cse1 c_~head~0.base) .cse2) (not (= .cse1 |c_ULTIMATE.start_main_~temp~0#1.base|))) .cse2 (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| .cse1)) (.cse7 (select |c_#memory_$Pointer$#1.base| .cse1))) (or (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse3 (select .cse7 .cse6))) (and (= .cse3 |c_ULTIMATE.start_main_~temp~0#1.base|) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse4 (@diff |v_#memory_int#1_BEFORE_CALL_8| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse1) 0) 1) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse4 (select |#memory_int#1| .cse4))) (= (select (select |#memory_int#1| .cse3) 0) 2) (= .cse4 c_~head~0.base)))) (= (select .cse5 .cse6) |c_ULTIMATE.start_main_~temp~0#1.offset|))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse9 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse8 (select .cse5 .cse9))) (and (not (= .cse8 0)) (= (select .cse7 .cse9) |c_ULTIMATE.start_main_~temp~0#1.base|) (= .cse8 |c_ULTIMATE.start_main_~temp~0#1.offset|))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse11 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse10 (select .cse7 .cse11))) (and (= .cse10 |c_ULTIMATE.start_main_~temp~0#1.base|) (= (select .cse5 .cse11) |c_ULTIMATE.start_main_~temp~0#1.offset|) (not (= .cse1 .cse10))))))))))) is different from true [2024-11-22 18:09:25,794 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) 4))) (or (and (= .cse0 c_~head~0.base) (= c_~head~0.offset .cse1)) (not (= |c_ULTIMATE.start_delete_list_~l#1.offset| .cse1)) (not (= .cse0 |c_ULTIMATE.start_delete_list_~l#1.base|)))) (= c_~head~0.offset 0) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| c_~head~0.base) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.offset| 0) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| .cse7)) (.cse3 (select |c_#memory_$Pointer$#1.base| .cse7))) (or (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse4 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse2 (select .cse5 .cse4))) (and (= .cse2 |c_ULTIMATE.start_delete_list_~l#1.offset|) (not (= .cse2 0)) (= (select .cse3 .cse4) |c_ULTIMATE.start_delete_list_~l#1.base|))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse9 (select .cse3 .cse6))) (and (= (select .cse5 .cse6) |c_ULTIMATE.start_delete_list_~l#1.offset|) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse8 (@diff |v_#memory_int#1_BEFORE_CALL_8| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse7) 0) 1) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse8 (select |#memory_int#1| .cse8))) (= (select (select |#memory_int#1| .cse9) 0) 2) (= .cse8 c_~head~0.base)))) (= .cse9 |c_ULTIMATE.start_delete_list_~l#1.base|))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse10 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse11 (select .cse3 .cse10))) (and (= (select .cse5 .cse10) |c_ULTIMATE.start_delete_list_~l#1.offset|) (not (= .cse7 .cse11)) (= .cse11 |c_ULTIMATE.start_delete_list_~l#1.base|))))))))) is different from false [2024-11-22 18:09:25,796 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) 4))) (or (and (= .cse0 c_~head~0.base) (= c_~head~0.offset .cse1)) (not (= |c_ULTIMATE.start_delete_list_~l#1.offset| .cse1)) (not (= .cse0 |c_ULTIMATE.start_delete_list_~l#1.base|)))) (= c_~head~0.offset 0) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| c_~head~0.base) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.offset| 0) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse5 (select |c_#memory_$Pointer$#1.offset| .cse7)) (.cse3 (select |c_#memory_$Pointer$#1.base| .cse7))) (or (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse4 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse2 (select .cse5 .cse4))) (and (= .cse2 |c_ULTIMATE.start_delete_list_~l#1.offset|) (not (= .cse2 0)) (= (select .cse3 .cse4) |c_ULTIMATE.start_delete_list_~l#1.base|))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse6 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse9 (select .cse3 .cse6))) (and (= (select .cse5 .cse6) |c_ULTIMATE.start_delete_list_~l#1.offset|) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse8 (@diff |v_#memory_int#1_BEFORE_CALL_8| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse7) 0) 1) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse8 (select |#memory_int#1| .cse8))) (= (select (select |#memory_int#1| .cse9) 0) 2) (= .cse8 c_~head~0.base)))) (= .cse9 |c_ULTIMATE.start_delete_list_~l#1.base|))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse10 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse11 (select .cse3 .cse10))) (and (= (select .cse5 .cse10) |c_ULTIMATE.start_delete_list_~l#1.offset|) (not (= .cse7 .cse11)) (= .cse11 |c_ULTIMATE.start_delete_list_~l#1.base|))))))))) is different from true [2024-11-22 18:09:25,834 WARN L851 $PredicateComparison]: unable to prove that (and (or (not (= |c_ULTIMATE.start_delete_list_~l#1.offset| 0)) (not (= |c_ULTIMATE.start_delete_list_~l#1.base| c_~head~0.base))) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| c_~head~0.base) (or (not (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) 4))) (not (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) 4) |c_ULTIMATE.start_delete_list_~l#1.base|))) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.offset| 0) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse5)) (.cse1 (select |c_#memory_$Pointer$#1.base| .cse5))) (or (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse0 (select .cse3 .cse2))) (and (= .cse0 |c_ULTIMATE.start_delete_list_~l#1.offset|) (not (= .cse0 0)) (= (select .cse1 .cse2) |c_ULTIMATE.start_delete_list_~l#1.base|))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse4 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse7 (select .cse1 .cse4))) (and (= (select .cse3 .cse4) |c_ULTIMATE.start_delete_list_~l#1.offset|) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_#memory_int#1_BEFORE_CALL_8| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse5) 0) 1) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse6 (select |#memory_int#1| .cse6))) (= (select (select |#memory_int#1| .cse7) 0) 2) (= .cse6 c_~head~0.base)))) (= .cse7 |c_ULTIMATE.start_delete_list_~l#1.base|))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse9 (select .cse1 .cse8))) (and (= (select .cse3 .cse8) |c_ULTIMATE.start_delete_list_~l#1.offset|) (not (= .cse5 .cse9)) (= .cse9 |c_ULTIMATE.start_delete_list_~l#1.base|))))))))) is different from false [2024-11-22 18:09:25,836 WARN L873 $PredicateComparison]: unable to prove that (and (or (not (= |c_ULTIMATE.start_delete_list_~l#1.offset| 0)) (not (= |c_ULTIMATE.start_delete_list_~l#1.base| c_~head~0.base))) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.base| c_~head~0.base) (or (not (= |c_ULTIMATE.start_delete_list_~l#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) 4))) (not (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) 4) |c_ULTIMATE.start_delete_list_~l#1.base|))) (= (select (select |c_#memory_$Pointer$#1.offset| c_~head~0.base) 4) 0) (= |c_ULTIMATE.start_delete_list_~tmp~0#1.offset| 0) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| c_~head~0.base) 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.offset| .cse5)) (.cse1 (select |c_#memory_$Pointer$#1.base| .cse5))) (or (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse2 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse0 (select .cse3 .cse2))) (and (= .cse0 |c_ULTIMATE.start_delete_list_~l#1.offset|) (not (= .cse0 0)) (= (select .cse1 .cse2) |c_ULTIMATE.start_delete_list_~l#1.base|))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse4 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse7 (select .cse1 .cse4))) (and (= (select .cse3 .cse4) |c_ULTIMATE.start_delete_list_~l#1.offset|) (exists ((|#memory_int#1| (Array Int (Array Int Int))) (|v_#memory_int#1_BEFORE_CALL_8| (Array Int (Array Int Int)))) (let ((.cse6 (@diff |v_#memory_int#1_BEFORE_CALL_8| |#memory_int#1|))) (and (= (select (select |v_#memory_int#1_BEFORE_CALL_8| .cse5) 0) 1) (= |#memory_int#1| (store |v_#memory_int#1_BEFORE_CALL_8| .cse6 (select |#memory_int#1| .cse6))) (= (select (select |#memory_int#1| .cse7) 0) 2) (= .cse6 c_~head~0.base)))) (= .cse7 |c_ULTIMATE.start_delete_list_~l#1.base|))))) (exists ((|v_ULTIMATE.start_search_list_~l#1.offset_46| Int)) (let ((.cse8 (+ |v_ULTIMATE.start_search_list_~l#1.offset_46| 4))) (let ((.cse9 (select .cse1 .cse8))) (and (= (select .cse3 .cse8) |c_ULTIMATE.start_delete_list_~l#1.offset|) (not (= .cse5 .cse9)) (= .cse9 |c_ULTIMATE.start_delete_list_~l#1.base|))))))))) is different from true [2024-11-22 18:09:25,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:09:25,999 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2024-11-22 18:09:25,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-22 18:09:25,999 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.0) internal successors, (62), 30 states have internal predecessors, (62), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) Word has length 57 [2024-11-22 18:09:25,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:09:26,000 INFO L225 Difference]: With dead ends: 83 [2024-11-22 18:09:26,000 INFO L226 Difference]: Without dead ends: 83 [2024-11-22 18:09:26,001 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 64 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=199, Invalid=1649, Unknown=42, NotChecked=2142, Total=4032 [2024-11-22 18:09:26,001 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 953 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 18:09:26,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 274 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 392 Invalid, 0 Unknown, 953 Unchecked, 0.2s Time] [2024-11-22 18:09:26,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-22 18:09:26,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 71. [2024-11-22 18:09:26,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 61 states have (on average 1.098360655737705) internal successors, (67), 62 states have internal predecessors, (67), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 18:09:26,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2024-11-22 18:09:26,005 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 57 [2024-11-22 18:09:26,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:09:26,006 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2024-11-22 18:09:26,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.0) internal successors, (62), 30 states have internal predecessors, (62), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-22 18:09:26,006 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2024-11-22 18:09:26,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-22 18:09:26,007 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:09:26,007 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1] [2024-11-22 18:09:26,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-22 18:09:26,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-22 18:09:26,208 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:09:26,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:09:26,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1273463809, now seen corresponding path program 1 times [2024-11-22 18:09:26,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:09:26,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228223718] [2024-11-22 18:09:26,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:09:26,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:09:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:09:27,613 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 21 proven. 17 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-22 18:09:27,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:09:27,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228223718] [2024-11-22 18:09:27,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228223718] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:09:27,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945634496] [2024-11-22 18:09:27,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 18:09:27,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:09:27,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:09:27,617 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:09:27,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-22 18:09:27,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 18:09:27,834 INFO L255 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-22 18:09:27,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:09:27,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2024-11-22 18:09:27,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:09:28,056 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-22 18:09:28,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-22 18:09:28,346 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-22 18:09:28,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-11-22 18:09:28,388 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-22 18:09:28,389 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-22 18:09:28,389 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:09:28,432 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1539 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_delete_list_~tmp~0#1.base| v_ArrVal_1539) c_~head~0.base) (+ c_~head~0.offset 4)) 0))) is different from false [2024-11-22 18:09:28,439 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1539 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_delete_list_~tmp~0#1.base|) (+ |c_ULTIMATE.start_delete_list_~tmp~0#1.offset| 4)) v_ArrVal_1539) c_~head~0.base) (+ c_~head~0.offset 4)) 0))) is different from false [2024-11-22 18:09:28,548 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:09:28,548 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 19 treesize of output 20 [2024-11-22 18:09:28,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2024-11-22 18:09:28,559 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-11-22 18:09:28,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945634496] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:09:28,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:09:28,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 14] total 35 [2024-11-22 18:09:28,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11546601] [2024-11-22 18:09:28,609 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:09:28,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-22 18:09:28,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:09:28,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-22 18:09:28,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1311, Unknown=8, NotChecked=150, Total=1640 [2024-11-22 18:09:28,611 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand has 35 states, 35 states have (on average 2.3142857142857145) internal successors, (81), 33 states have internal predecessors, (81), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-22 18:09:30,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:09:30,094 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2024-11-22 18:09:30,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-11-22 18:09:30,094 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.3142857142857145) internal successors, (81), 33 states have internal predecessors, (81), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) Word has length 59 [2024-11-22 18:09:30,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:09:30,095 INFO L225 Difference]: With dead ends: 106 [2024-11-22 18:09:30,095 INFO L226 Difference]: Without dead ends: 106 [2024-11-22 18:09:30,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1533 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=766, Invalid=5554, Unknown=8, NotChecked=314, Total=6642 [2024-11-22 18:09:30,097 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 117 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 922 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 960 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 922 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 18:09:30,098 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 259 Invalid, 960 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 922 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 18:09:30,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-22 18:09:30,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2024-11-22 18:09:30,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 78 states have (on average 1.1025641025641026) internal successors, (86), 79 states have internal predecessors, (86), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 18:09:30,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 97 transitions. [2024-11-22 18:09:30,103 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 97 transitions. Word has length 59 [2024-11-22 18:09:30,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:09:30,104 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 97 transitions. [2024-11-22 18:09:30,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.3142857142857145) internal successors, (81), 33 states have internal predecessors, (81), 3 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2024-11-22 18:09:30,104 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 97 transitions. [2024-11-22 18:09:30,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-22 18:09:30,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:09:30,105 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 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, 1, 1, 1, 1] [2024-11-22 18:09:30,114 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-22 18:09:30,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-22 18:09:30,305 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:09:30,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:09:30,306 INFO L85 PathProgramCache]: Analyzing trace with hash -822618551, now seen corresponding path program 2 times [2024-11-22 18:09:30,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:09:30,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257369250] [2024-11-22 18:09:30,306 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:09:30,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:09:30,348 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 18:09:30,348 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:09:34,202 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 17 proven. 31 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-22 18:09:34,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:09:34,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257369250] [2024-11-22 18:09:34,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257369250] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:09:34,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621909501] [2024-11-22 18:09:34,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 18:09:34,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:09:34,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:09:34,203 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:09:34,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-22 18:09:34,397 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 18:09:34,397 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:09:34,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 142 conjuncts are in the unsatisfiable core [2024-11-22 18:09:34,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:09:34,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 18:09:34,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:09:34,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:09:34,820 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 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-22 18:09:34,967 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-22 18:09:34,967 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 21 treesize of output 24 [2024-11-22 18:09:35,168 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 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-22 18:09:35,179 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 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-22 18:09:35,384 INFO L349 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2024-11-22 18:09:35,384 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 60 [2024-11-22 18:09:35,409 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 10 treesize of output 8 [2024-11-22 18:09:35,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-22 18:09:35,451 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-22 18:09:35,451 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-22 18:09:35,458 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 20 treesize of output 15 [2024-11-22 18:09:36,942 INFO L349 Elim1Store]: treesize reduction 52, result has 26.8 percent of original size [2024-11-22 18:09:36,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 103 treesize of output 59 [2024-11-22 18:09:36,946 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 16 [2024-11-22 18:09:37,142 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-22 18:09:37,253 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2024-11-22 18:09:37,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 22 [2024-11-22 18:09:37,257 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 27 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 18:09:37,257 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:09:38,914 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:09:38,914 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 206 treesize of output 182 [2024-11-22 18:09:38,920 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:09:38,920 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 176 treesize of output 167 [2024-11-22 18:09:39,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621909501] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:09:39,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 18:09:39,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 33] total 66 [2024-11-22 18:09:39,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560989355] [2024-11-22 18:09:39,595 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 18:09:39,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-11-22 18:09:39,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:09:39,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-11-22 18:09:39,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=5821, Unknown=4, NotChecked=0, Total=6162 [2024-11-22 18:09:39,598 INFO L87 Difference]: Start difference. First operand 88 states and 97 transitions. Second operand has 66 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 61 states have internal predecessors, (98), 6 states have call successors, (7), 6 states have call predecessors, (7), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-22 18:09:45,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 18:09:45,625 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2024-11-22 18:09:45,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-11-22 18:09:45,626 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 61 states have internal predecessors, (98), 6 states have call successors, (7), 6 states have call predecessors, (7), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 60 [2024-11-22 18:09:45,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 18:09:45,626 INFO L225 Difference]: With dead ends: 91 [2024-11-22 18:09:45,626 INFO L226 Difference]: Without dead ends: 86 [2024-11-22 18:09:45,629 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4063 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=1225, Invalid=15541, Unknown=4, NotChecked=0, Total=16770 [2024-11-22 18:09:45,630 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 144 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 2396 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 2459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 2396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-22 18:09:45,630 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 560 Invalid, 2459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 2396 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-22 18:09:45,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-22 18:09:45,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 72. [2024-11-22 18:09:45,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 62 states have (on average 1.096774193548387) internal successors, (68), 63 states have internal predecessors, (68), 5 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-22 18:09:45,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2024-11-22 18:09:45,633 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 60 [2024-11-22 18:09:45,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 18:09:45,634 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2024-11-22 18:09:45,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 1.4848484848484849) internal successors, (98), 61 states have internal predecessors, (98), 6 states have call successors, (7), 6 states have call predecessors, (7), 8 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2024-11-22 18:09:45,634 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2024-11-22 18:09:45,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-22 18:09:45,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 18:09:45,635 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1] [2024-11-22 18:09:45,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-22 18:09:45,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-22 18:09:45,836 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 18:09:45,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 18:09:45,836 INFO L85 PathProgramCache]: Analyzing trace with hash -400317308, now seen corresponding path program 3 times [2024-11-22 18:09:45,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 18:09:45,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093391925] [2024-11-22 18:09:45,836 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 18:09:45,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 18:09:45,865 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-22 18:09:45,865 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:09:47,946 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 17 proven. 23 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-22 18:09:47,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 18:09:47,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093391925] [2024-11-22 18:09:47,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093391925] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 18:09:47,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960652614] [2024-11-22 18:09:47,946 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 18:09:47,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 18:09:47,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 18:09:47,947 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 18:09:47,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-22 18:09:48,317 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2024-11-22 18:09:48,317 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 18:09:48,320 INFO L255 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 132 conjuncts are in the unsatisfiable core [2024-11-22 18:09:48,324 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 18:09:48,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-22 18:09:48,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:09:48,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-22 18:09:48,700 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 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-22 18:09:48,708 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 0 case distinctions, treesize of input 9 treesize of output 12 [2024-11-22 18:09:48,836 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 8 treesize of output 1 [2024-11-22 18:09:48,847 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-22 18:09:48,848 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 20 treesize of output 23 [2024-11-22 18:09:48,858 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-22 18:09:48,859 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-22 18:09:49,472 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 18:09:49,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2024-11-22 18:09:50,000 INFO L349 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2024-11-22 18:09:50,000 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 78 treesize of output 44 [2024-11-22 18:09:50,072 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 25 proven. 31 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-22 18:09:50,072 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 18:09:50,505 INFO L349 Elim1Store]: treesize reduction 4, result has 91.5 percent of original size [2024-11-22 18:09:50,506 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 52 treesize of output 51 [2024-11-22 18:09:50,862 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-22 18:09:50,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960652614] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 18:09:50,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 18:09:50,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 14] total 64 [2024-11-22 18:09:50,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546613771] [2024-11-22 18:09:50,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 18:09:50,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2024-11-22 18:09:50,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 18:09:50,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2024-11-22 18:09:50,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=3807, Unknown=0, NotChecked=0, Total=4032 [2024-11-22 18:09:50,864 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 64 states, 64 states have (on average 1.78125) internal successors, (114), 60 states have internal predecessors, (114), 5 states have call successors, (8), 5 states have call predecessors, (8), 7 states have return successors, (10), 7 states have call predecessors, (10), 5 states have call successors, (10)