./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/locks/test_locks_10.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c861265e1e1e27fe23877e47c41012b82996e1c7e91f362716a115cbf38b786b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 19:05:09,107 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 19:05:09,165 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 19:05:09,167 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 19:05:09,168 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 19:05:09,191 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 19:05:09,192 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 19:05:09,192 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 19:05:09,193 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 19:05:09,195 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 19:05:09,195 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 19:05:09,195 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 19:05:09,196 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 19:05:09,196 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 19:05:09,196 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 19:05:09,196 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 19:05:09,196 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 19:05:09,197 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 19:05:09,197 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 19:05:09,197 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 19:05:09,197 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 19:05:09,201 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 19:05:09,201 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 19:05:09,201 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 19:05:09,201 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 19:05:09,202 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 19:05:09,202 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 19:05:09,202 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 19:05:09,202 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 19:05:09,202 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 19:05:09,203 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 19:05:09,203 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 19:05:09,203 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 19:05:09,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 19:05:09,203 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 19:05:09,203 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 19:05:09,203 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 19:05:09,203 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 19:05:09,204 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 19:05:09,204 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 19:05:09,204 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 19:05:09,206 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 19:05:09,206 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c861265e1e1e27fe23877e47c41012b82996e1c7e91f362716a115cbf38b786b [2024-11-22 19:05:09,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 19:05:09,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 19:05:09,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 19:05:09,452 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 19:05:09,452 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 19:05:09,453 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_10.c [2024-11-22 19:05:10,846 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 19:05:10,999 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 19:05:10,999 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_10.c [2024-11-22 19:05:11,006 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5fad8780/2069b5a4681f47e6af61540e798863a9/FLAG62fba8f69 [2024-11-22 19:05:11,415 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5fad8780/2069b5a4681f47e6af61540e798863a9 [2024-11-22 19:05:11,418 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 19:05:11,419 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 19:05:11,420 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 19:05:11,420 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 19:05:11,425 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 19:05:11,426 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:05:11" (1/1) ... [2024-11-22 19:05:11,426 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37e51e57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:11, skipping insertion in model container [2024-11-22 19:05:11,427 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:05:11" (1/1) ... [2024-11-22 19:05:11,446 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 19:05:11,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 19:05:11,631 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 19:05:11,647 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 19:05:11,660 INFO L204 MainTranslator]: Completed translation [2024-11-22 19:05:11,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:11 WrapperNode [2024-11-22 19:05:11,660 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 19:05:11,661 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 19:05:11,661 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 19:05:11,661 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 19:05:11,666 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:11" (1/1) ... [2024-11-22 19:05:11,672 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:11" (1/1) ... [2024-11-22 19:05:11,687 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 149 [2024-11-22 19:05:11,688 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 19:05:11,688 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 19:05:11,689 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 19:05:11,689 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 19:05:11,697 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:11" (1/1) ... [2024-11-22 19:05:11,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:11" (1/1) ... [2024-11-22 19:05:11,698 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:11" (1/1) ... [2024-11-22 19:05:11,707 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 19:05:11,708 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:11" (1/1) ... [2024-11-22 19:05:11,708 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:11" (1/1) ... [2024-11-22 19:05:11,710 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:11" (1/1) ... [2024-11-22 19:05:11,713 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:11" (1/1) ... [2024-11-22 19:05:11,715 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:11" (1/1) ... [2024-11-22 19:05:11,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:11" (1/1) ... [2024-11-22 19:05:11,717 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 19:05:11,718 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 19:05:11,718 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 19:05:11,718 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 19:05:11,719 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:11" (1/1) ... [2024-11-22 19:05:11,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 19:05:11,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 19:05:11,756 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 19:05:11,760 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 19:05:11,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 19:05:11,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 19:05:11,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 19:05:11,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 19:05:11,857 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 19:05:11,860 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 19:05:12,098 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-22 19:05:12,098 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 19:05:12,110 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 19:05:12,110 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 19:05:12,111 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:05:12 BoogieIcfgContainer [2024-11-22 19:05:12,111 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 19:05:12,112 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 19:05:12,113 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 19:05:12,115 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 19:05:12,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 07:05:11" (1/3) ... [2024-11-22 19:05:12,116 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dfb2af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:05:12, skipping insertion in model container [2024-11-22 19:05:12,116 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:05:11" (2/3) ... [2024-11-22 19:05:12,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2dfb2af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:05:12, skipping insertion in model container [2024-11-22 19:05:12,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:05:12" (3/3) ... [2024-11-22 19:05:12,118 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2024-11-22 19:05:12,131 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 19:05:12,132 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2024-11-22 19:05:12,166 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 19:05:12,171 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;@5cc03b83, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 19:05:12,172 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2024-11-22 19:05:12,175 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 40 states have (on average 1.875) internal successors, (75), 42 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:12,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-22 19:05:12,180 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:12,180 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 19:05:12,181 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:12,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:12,185 INFO L85 PathProgramCache]: Analyzing trace with hash 28703470, now seen corresponding path program 1 times [2024-11-22 19:05:12,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:12,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270713790] [2024-11-22 19:05:12,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:12,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:12,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:12,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:12,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270713790] [2024-11-22 19:05:12,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270713790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:12,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:12,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 19:05:12,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036559249] [2024-11-22 19:05:12,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:12,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 19:05:12,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:12,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 19:05:12,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 19:05:12,369 INFO L87 Difference]: Start difference. First operand has 43 states, 40 states have (on average 1.875) internal successors, (75), 42 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:12,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:12,382 INFO L93 Difference]: Finished difference Result 42 states and 71 transitions. [2024-11-22 19:05:12,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 19:05:12,384 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-22 19:05:12,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:12,389 INFO L225 Difference]: With dead ends: 42 [2024-11-22 19:05:12,389 INFO L226 Difference]: Without dead ends: 40 [2024-11-22 19:05:12,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 19:05:12,394 INFO L432 NwaCegarLoop]: 71 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, 71 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 19:05:12,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:12,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-22 19:05:12,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-22 19:05:12,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 38 states have (on average 1.8157894736842106) internal successors, (69), 39 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:12,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 69 transitions. [2024-11-22 19:05:12,425 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 69 transitions. Word has length 5 [2024-11-22 19:05:12,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:12,425 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 69 transitions. [2024-11-22 19:05:12,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:12,426 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 69 transitions. [2024-11-22 19:05:12,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-22 19:05:12,426 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:12,426 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-22 19:05:12,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 19:05:12,427 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:12,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:12,428 INFO L85 PathProgramCache]: Analyzing trace with hash 889697966, now seen corresponding path program 1 times [2024-11-22 19:05:12,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:12,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411889990] [2024-11-22 19:05:12,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:12,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:12,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:12,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:12,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:12,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411889990] [2024-11-22 19:05:12,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411889990] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:12,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:12,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 19:05:12,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114452079] [2024-11-22 19:05:12,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:12,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:12,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:12,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:12,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:12,504 INFO L87 Difference]: Start difference. First operand 40 states and 69 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:12,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:12,517 INFO L93 Difference]: Finished difference Result 39 states and 68 transitions. [2024-11-22 19:05:12,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:12,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-22 19:05:12,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:12,518 INFO L225 Difference]: With dead ends: 39 [2024-11-22 19:05:12,518 INFO L226 Difference]: Without dead ends: 37 [2024-11-22 19:05:12,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:12,519 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 63 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:12,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 68 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:12,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-22 19:05:12,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-22 19:05:12,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 36 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:12,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 66 transitions. [2024-11-22 19:05:12,526 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 66 transitions. Word has length 6 [2024-11-22 19:05:12,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:12,527 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 66 transitions. [2024-11-22 19:05:12,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:12,527 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 66 transitions. [2024-11-22 19:05:12,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-22 19:05:12,528 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:12,528 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:12,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 19:05:12,528 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:12,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:12,530 INFO L85 PathProgramCache]: Analyzing trace with hash 458860360, now seen corresponding path program 1 times [2024-11-22 19:05:12,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:12,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115527824] [2024-11-22 19:05:12,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:12,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:12,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:12,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:12,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:12,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115527824] [2024-11-22 19:05:12,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115527824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:12,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:12,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:12,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969756608] [2024-11-22 19:05:12,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:12,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:12,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:12,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:12,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:12,606 INFO L87 Difference]: Start difference. First operand 37 states and 66 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:12,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:12,625 INFO L93 Difference]: Finished difference Result 71 states and 127 transitions. [2024-11-22 19:05:12,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:12,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-22 19:05:12,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:12,627 INFO L225 Difference]: With dead ends: 71 [2024-11-22 19:05:12,627 INFO L226 Difference]: Without dead ends: 71 [2024-11-22 19:05:12,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:12,628 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 49 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:12,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 130 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:12,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-22 19:05:12,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 48. [2024-11-22 19:05:12,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.851063829787234) internal successors, (87), 47 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:12,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 87 transitions. [2024-11-22 19:05:12,633 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 87 transitions. Word has length 18 [2024-11-22 19:05:12,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:12,633 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 87 transitions. [2024-11-22 19:05:12,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:12,634 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 87 transitions. [2024-11-22 19:05:12,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-22 19:05:12,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:12,634 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:12,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 19:05:12,635 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:12,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:12,635 INFO L85 PathProgramCache]: Analyzing trace with hash -552256890, now seen corresponding path program 1 times [2024-11-22 19:05:12,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:12,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029106674] [2024-11-22 19:05:12,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:12,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:12,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:12,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:12,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029106674] [2024-11-22 19:05:12,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029106674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:12,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:12,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:12,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923560522] [2024-11-22 19:05:12,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:12,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:12,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:12,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:12,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:12,673 INFO L87 Difference]: Start difference. First operand 48 states and 87 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:12,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:12,694 INFO L93 Difference]: Finished difference Result 71 states and 125 transitions. [2024-11-22 19:05:12,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:12,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-22 19:05:12,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:12,696 INFO L225 Difference]: With dead ends: 71 [2024-11-22 19:05:12,696 INFO L226 Difference]: Without dead ends: 71 [2024-11-22 19:05:12,696 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:12,698 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 49 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:12,699 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 145 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:12,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-22 19:05:12,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2024-11-22 19:05:12,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.835820895522388) internal successors, (123), 67 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:12,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 123 transitions. [2024-11-22 19:05:12,707 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 123 transitions. Word has length 18 [2024-11-22 19:05:12,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:12,708 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 123 transitions. [2024-11-22 19:05:12,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:12,709 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 123 transitions. [2024-11-22 19:05:12,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-22 19:05:12,709 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:12,710 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:12,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 19:05:12,710 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:12,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:12,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1346377270, now seen corresponding path program 1 times [2024-11-22 19:05:12,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:12,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778814707] [2024-11-22 19:05:12,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:12,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:12,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:12,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:12,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:12,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778814707] [2024-11-22 19:05:12,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778814707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:12,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:12,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:12,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482524739] [2024-11-22 19:05:12,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:12,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:12,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:12,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:12,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:12,781 INFO L87 Difference]: Start difference. First operand 68 states and 123 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:12,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:12,803 INFO L93 Difference]: Finished difference Result 74 states and 127 transitions. [2024-11-22 19:05:12,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:12,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-22 19:05:12,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:12,805 INFO L225 Difference]: With dead ends: 74 [2024-11-22 19:05:12,805 INFO L226 Difference]: Without dead ends: 74 [2024-11-22 19:05:12,806 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:12,806 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 51 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:12,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:12,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-22 19:05:12,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2024-11-22 19:05:12,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.7857142857142858) internal successors, (125), 70 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:12,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 125 transitions. [2024-11-22 19:05:12,819 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 125 transitions. Word has length 19 [2024-11-22 19:05:12,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:12,820 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 125 transitions. [2024-11-22 19:05:12,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:12,820 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 125 transitions. [2024-11-22 19:05:12,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-22 19:05:12,821 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:12,821 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:12,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 19:05:12,821 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:12,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:12,823 INFO L85 PathProgramCache]: Analyzing trace with hash 66513592, now seen corresponding path program 1 times [2024-11-22 19:05:12,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:12,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128963302] [2024-11-22 19:05:12,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:12,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:12,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:12,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:12,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128963302] [2024-11-22 19:05:12,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128963302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:12,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:12,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:12,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888665027] [2024-11-22 19:05:12,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:12,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:12,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:12,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:12,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:12,856 INFO L87 Difference]: Start difference. First operand 71 states and 125 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:12,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:12,867 INFO L93 Difference]: Finished difference Result 133 states and 236 transitions. [2024-11-22 19:05:12,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:12,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-22 19:05:12,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:12,869 INFO L225 Difference]: With dead ends: 133 [2024-11-22 19:05:12,869 INFO L226 Difference]: Without dead ends: 133 [2024-11-22 19:05:12,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:12,870 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 46 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:12,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 128 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:12,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-22 19:05:12,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 94. [2024-11-22 19:05:12,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.7849462365591398) internal successors, (166), 93 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:12,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 166 transitions. [2024-11-22 19:05:12,876 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 166 transitions. Word has length 19 [2024-11-22 19:05:12,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:12,876 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 166 transitions. [2024-11-22 19:05:12,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:12,877 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 166 transitions. [2024-11-22 19:05:12,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-22 19:05:12,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:12,877 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:12,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 19:05:12,878 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:12,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:12,878 INFO L85 PathProgramCache]: Analyzing trace with hash -944603658, now seen corresponding path program 1 times [2024-11-22 19:05:12,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:12,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613174811] [2024-11-22 19:05:12,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:12,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:12,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:12,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:12,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613174811] [2024-11-22 19:05:12,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613174811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:12,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:12,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:12,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154256875] [2024-11-22 19:05:12,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:12,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:12,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:12,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:12,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:12,927 INFO L87 Difference]: Start difference. First operand 94 states and 166 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:12,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:12,948 INFO L93 Difference]: Finished difference Result 135 states and 234 transitions. [2024-11-22 19:05:12,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:12,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-22 19:05:12,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:12,950 INFO L225 Difference]: With dead ends: 135 [2024-11-22 19:05:12,950 INFO L226 Difference]: Without dead ends: 135 [2024-11-22 19:05:12,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:12,951 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 48 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:12,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 146 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:12,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-22 19:05:12,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2024-11-22 19:05:12,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.7709923664122138) internal successors, (232), 131 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:12,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 232 transitions. [2024-11-22 19:05:12,965 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 232 transitions. Word has length 19 [2024-11-22 19:05:12,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:12,966 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 232 transitions. [2024-11-22 19:05:12,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:12,968 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 232 transitions. [2024-11-22 19:05:12,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-22 19:05:12,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:12,969 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:12,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 19:05:12,969 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:12,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:12,970 INFO L85 PathProgramCache]: Analyzing trace with hash 2068539921, now seen corresponding path program 1 times [2024-11-22 19:05:12,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:12,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050847491] [2024-11-22 19:05:12,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:12,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:12,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:12,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:12,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:12,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050847491] [2024-11-22 19:05:12,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050847491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:12,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:12,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:12,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269932562] [2024-11-22 19:05:12,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:12,999 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:13,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:13,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:13,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:13,001 INFO L87 Difference]: Start difference. First operand 132 states and 232 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:13,013 INFO L93 Difference]: Finished difference Result 137 states and 234 transitions. [2024-11-22 19:05:13,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:13,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-22 19:05:13,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:13,015 INFO L225 Difference]: With dead ends: 137 [2024-11-22 19:05:13,015 INFO L226 Difference]: Without dead ends: 137 [2024-11-22 19:05:13,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:13,016 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 50 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:13,016 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 159 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:13,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-22 19:05:13,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2024-11-22 19:05:13,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 133 states have (on average 1.744360902255639) internal successors, (232), 133 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 232 transitions. [2024-11-22 19:05:13,029 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 232 transitions. Word has length 20 [2024-11-22 19:05:13,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:13,032 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 232 transitions. [2024-11-22 19:05:13,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,033 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 232 transitions. [2024-11-22 19:05:13,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-22 19:05:13,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:13,033 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:13,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 19:05:13,034 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:13,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:13,034 INFO L85 PathProgramCache]: Analyzing trace with hash 788676243, now seen corresponding path program 1 times [2024-11-22 19:05:13,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:13,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50289596] [2024-11-22 19:05:13,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:13,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:13,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:13,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:13,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:13,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50289596] [2024-11-22 19:05:13,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50289596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:13,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:13,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:13,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055312780] [2024-11-22 19:05:13,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:13,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:13,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:13,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:13,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:13,070 INFO L87 Difference]: Start difference. First operand 134 states and 232 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:13,088 INFO L93 Difference]: Finished difference Result 257 states and 438 transitions. [2024-11-22 19:05:13,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:13,089 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-22 19:05:13,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:13,090 INFO L225 Difference]: With dead ends: 257 [2024-11-22 19:05:13,093 INFO L226 Difference]: Without dead ends: 257 [2024-11-22 19:05:13,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:13,094 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 48 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:13,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 130 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:13,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-22 19:05:13,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 254. [2024-11-22 19:05:13,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 1.7233201581027668) internal successors, (436), 253 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 436 transitions. [2024-11-22 19:05:13,108 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 436 transitions. Word has length 20 [2024-11-22 19:05:13,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:13,108 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 436 transitions. [2024-11-22 19:05:13,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,109 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 436 transitions. [2024-11-22 19:05:13,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-22 19:05:13,110 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:13,110 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:13,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 19:05:13,110 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:13,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:13,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1799793493, now seen corresponding path program 1 times [2024-11-22 19:05:13,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:13,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626196803] [2024-11-22 19:05:13,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:13,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:13,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:13,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:13,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626196803] [2024-11-22 19:05:13,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626196803] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:13,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:13,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:13,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152611967] [2024-11-22 19:05:13,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:13,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:13,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:13,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:13,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:13,138 INFO L87 Difference]: Start difference. First operand 254 states and 436 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:13,146 INFO L93 Difference]: Finished difference Result 321 states and 554 transitions. [2024-11-22 19:05:13,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:13,147 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-22 19:05:13,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:13,149 INFO L225 Difference]: With dead ends: 321 [2024-11-22 19:05:13,150 INFO L226 Difference]: Without dead ends: 321 [2024-11-22 19:05:13,150 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:13,150 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 43 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:13,151 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 173 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:13,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-22 19:05:13,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 254. [2024-11-22 19:05:13,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 253 states have (on average 1.7075098814229248) internal successors, (432), 253 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 432 transitions. [2024-11-22 19:05:13,168 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 432 transitions. Word has length 20 [2024-11-22 19:05:13,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:13,168 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 432 transitions. [2024-11-22 19:05:13,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,169 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 432 transitions. [2024-11-22 19:05:13,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-22 19:05:13,170 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:13,170 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:13,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 19:05:13,170 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:13,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:13,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1314211103, now seen corresponding path program 1 times [2024-11-22 19:05:13,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:13,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062374743] [2024-11-22 19:05:13,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:13,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:13,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:13,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:13,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:13,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062374743] [2024-11-22 19:05:13,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062374743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:13,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:13,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:13,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961793221] [2024-11-22 19:05:13,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:13,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:13,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:13,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:13,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:13,224 INFO L87 Difference]: Start difference. First operand 254 states and 432 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:13,253 INFO L93 Difference]: Finished difference Result 469 states and 802 transitions. [2024-11-22 19:05:13,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:13,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-22 19:05:13,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:13,255 INFO L225 Difference]: With dead ends: 469 [2024-11-22 19:05:13,255 INFO L226 Difference]: Without dead ends: 469 [2024-11-22 19:05:13,255 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:13,256 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 40 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:13,256 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 124 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:13,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-11-22 19:05:13,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 354. [2024-11-22 19:05:13,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 353 states have (on average 1.6770538243626063) internal successors, (592), 353 states have internal predecessors, (592), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 592 transitions. [2024-11-22 19:05:13,270 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 592 transitions. Word has length 21 [2024-11-22 19:05:13,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:13,270 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 592 transitions. [2024-11-22 19:05:13,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,270 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 592 transitions. [2024-11-22 19:05:13,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-22 19:05:13,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:13,276 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:13,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 19:05:13,276 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:13,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:13,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1969638943, now seen corresponding path program 1 times [2024-11-22 19:05:13,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:13,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077148582] [2024-11-22 19:05:13,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:13,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:13,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:13,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:13,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:13,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077148582] [2024-11-22 19:05:13,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077148582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:13,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:13,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:13,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032414593] [2024-11-22 19:05:13,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:13,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:13,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:13,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:13,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:13,342 INFO L87 Difference]: Start difference. First operand 354 states and 592 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:13,351 INFO L93 Difference]: Finished difference Result 493 states and 814 transitions. [2024-11-22 19:05:13,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:13,352 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-22 19:05:13,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:13,354 INFO L225 Difference]: With dead ends: 493 [2024-11-22 19:05:13,354 INFO L226 Difference]: Without dead ends: 493 [2024-11-22 19:05:13,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:13,354 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 46 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:13,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 148 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:13,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2024-11-22 19:05:13,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 490. [2024-11-22 19:05:13,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 489 states have (on average 1.6605316973415134) internal successors, (812), 489 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 812 transitions. [2024-11-22 19:05:13,365 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 812 transitions. Word has length 21 [2024-11-22 19:05:13,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:13,366 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 812 transitions. [2024-11-22 19:05:13,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,366 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 812 transitions. [2024-11-22 19:05:13,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-22 19:05:13,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:13,367 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:13,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 19:05:13,367 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:13,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:13,368 INFO L85 PathProgramCache]: Analyzing trace with hash -2079198818, now seen corresponding path program 1 times [2024-11-22 19:05:13,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:13,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441360797] [2024-11-22 19:05:13,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:13,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:13,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:13,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:13,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:13,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441360797] [2024-11-22 19:05:13,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441360797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:13,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:13,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:13,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647932] [2024-11-22 19:05:13,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:13,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:13,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:13,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:13,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:13,397 INFO L87 Difference]: Start difference. First operand 490 states and 812 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:13,410 INFO L93 Difference]: Finished difference Result 505 states and 822 transitions. [2024-11-22 19:05:13,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:13,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-22 19:05:13,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:13,412 INFO L225 Difference]: With dead ends: 505 [2024-11-22 19:05:13,413 INFO L226 Difference]: Without dead ends: 505 [2024-11-22 19:05:13,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:13,414 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 48 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:13,415 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:13,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2024-11-22 19:05:13,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 502. [2024-11-22 19:05:13,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 501 states have (on average 1.6367265469061876) internal successors, (820), 501 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 820 transitions. [2024-11-22 19:05:13,422 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 820 transitions. Word has length 22 [2024-11-22 19:05:13,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:13,423 INFO L471 AbstractCegarLoop]: Abstraction has 502 states and 820 transitions. [2024-11-22 19:05:13,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,423 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 820 transitions. [2024-11-22 19:05:13,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-22 19:05:13,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:13,424 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:13,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 19:05:13,424 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:13,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:13,425 INFO L85 PathProgramCache]: Analyzing trace with hash 935904800, now seen corresponding path program 1 times [2024-11-22 19:05:13,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:13,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799102917] [2024-11-22 19:05:13,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:13,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:13,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:13,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:13,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:13,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799102917] [2024-11-22 19:05:13,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799102917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:13,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:13,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:13,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100608137] [2024-11-22 19:05:13,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:13,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:13,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:13,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:13,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:13,455 INFO L87 Difference]: Start difference. First operand 502 states and 820 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:13,468 INFO L93 Difference]: Finished difference Result 905 states and 1486 transitions. [2024-11-22 19:05:13,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:13,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-22 19:05:13,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:13,471 INFO L225 Difference]: With dead ends: 905 [2024-11-22 19:05:13,471 INFO L226 Difference]: Without dead ends: 905 [2024-11-22 19:05:13,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:13,472 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 37 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:13,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 122 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:13,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2024-11-22 19:05:13,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 710. [2024-11-22 19:05:13,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 709 states have (on average 1.5966149506346967) internal successors, (1132), 709 states have internal predecessors, (1132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 1132 transitions. [2024-11-22 19:05:13,485 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 1132 transitions. Word has length 22 [2024-11-22 19:05:13,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:13,485 INFO L471 AbstractCegarLoop]: Abstraction has 710 states and 1132 transitions. [2024-11-22 19:05:13,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,485 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 1132 transitions. [2024-11-22 19:05:13,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-22 19:05:13,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:13,487 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:13,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 19:05:13,488 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:13,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:13,488 INFO L85 PathProgramCache]: Analyzing trace with hash -75212450, now seen corresponding path program 1 times [2024-11-22 19:05:13,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:13,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053499535] [2024-11-22 19:05:13,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:13,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:13,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:13,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:13,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:13,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053499535] [2024-11-22 19:05:13,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053499535] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:13,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:13,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:13,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707635348] [2024-11-22 19:05:13,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:13,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:13,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:13,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:13,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:13,513 INFO L87 Difference]: Start difference. First operand 710 states and 1132 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:13,523 INFO L93 Difference]: Finished difference Result 969 states and 1526 transitions. [2024-11-22 19:05:13,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:13,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-22 19:05:13,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:13,526 INFO L225 Difference]: With dead ends: 969 [2024-11-22 19:05:13,527 INFO L226 Difference]: Without dead ends: 969 [2024-11-22 19:05:13,527 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:13,528 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 45 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:13,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 149 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:13,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2024-11-22 19:05:13,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 966. [2024-11-22 19:05:13,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 965 states have (on average 1.5792746113989637) internal successors, (1524), 965 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1524 transitions. [2024-11-22 19:05:13,542 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1524 transitions. Word has length 22 [2024-11-22 19:05:13,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:13,542 INFO L471 AbstractCegarLoop]: Abstraction has 966 states and 1524 transitions. [2024-11-22 19:05:13,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,543 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1524 transitions. [2024-11-22 19:05:13,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-22 19:05:13,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:13,544 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:13,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 19:05:13,544 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:13,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:13,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1045071990, now seen corresponding path program 1 times [2024-11-22 19:05:13,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:13,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053636942] [2024-11-22 19:05:13,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:13,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:13,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:13,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:13,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053636942] [2024-11-22 19:05:13,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053636942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:13,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:13,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:13,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078953338] [2024-11-22 19:05:13,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:13,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:13,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:13,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:13,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:13,577 INFO L87 Difference]: Start difference. First operand 966 states and 1524 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:13,590 INFO L93 Difference]: Finished difference Result 985 states and 1526 transitions. [2024-11-22 19:05:13,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:13,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-22 19:05:13,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:13,593 INFO L225 Difference]: With dead ends: 985 [2024-11-22 19:05:13,594 INFO L226 Difference]: Without dead ends: 985 [2024-11-22 19:05:13,594 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:13,595 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 47 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:13,595 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 147 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:13,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2024-11-22 19:05:13,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 982. [2024-11-22 19:05:13,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 1.5535168195718654) internal successors, (1524), 981 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1524 transitions. [2024-11-22 19:05:13,608 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1524 transitions. Word has length 23 [2024-11-22 19:05:13,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:13,609 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1524 transitions. [2024-11-22 19:05:13,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,609 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1524 transitions. [2024-11-22 19:05:13,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-22 19:05:13,610 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:13,610 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:13,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-22 19:05:13,610 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:13,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:13,611 INFO L85 PathProgramCache]: Analyzing trace with hash 1970031628, now seen corresponding path program 1 times [2024-11-22 19:05:13,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:13,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385089943] [2024-11-22 19:05:13,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:13,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:13,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:13,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:13,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385089943] [2024-11-22 19:05:13,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385089943] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:13,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:13,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:13,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477730706] [2024-11-22 19:05:13,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:13,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:13,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:13,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:13,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:13,641 INFO L87 Difference]: Start difference. First operand 982 states and 1524 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:13,654 INFO L93 Difference]: Finished difference Result 1737 states and 2710 transitions. [2024-11-22 19:05:13,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:13,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-22 19:05:13,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:13,659 INFO L225 Difference]: With dead ends: 1737 [2024-11-22 19:05:13,659 INFO L226 Difference]: Without dead ends: 1737 [2024-11-22 19:05:13,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:13,659 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 34 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:13,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 120 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:13,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1737 states. [2024-11-22 19:05:13,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1737 to 1414. [2024-11-22 19:05:13,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1414 states, 1413 states have (on average 1.5088464260438783) internal successors, (2132), 1413 states have internal predecessors, (2132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1414 states to 1414 states and 2132 transitions. [2024-11-22 19:05:13,680 INFO L78 Accepts]: Start accepts. Automaton has 1414 states and 2132 transitions. Word has length 23 [2024-11-22 19:05:13,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:13,680 INFO L471 AbstractCegarLoop]: Abstraction has 1414 states and 2132 transitions. [2024-11-22 19:05:13,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states and 2132 transitions. [2024-11-22 19:05:13,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-22 19:05:13,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:13,683 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:13,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-22 19:05:13,684 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:13,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:13,684 INFO L85 PathProgramCache]: Analyzing trace with hash 958914378, now seen corresponding path program 1 times [2024-11-22 19:05:13,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:13,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114223050] [2024-11-22 19:05:13,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:13,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:13,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:13,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:13,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:13,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114223050] [2024-11-22 19:05:13,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114223050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:13,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:13,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:13,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25653758] [2024-11-22 19:05:13,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:13,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:13,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:13,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:13,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:13,706 INFO L87 Difference]: Start difference. First operand 1414 states and 2132 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:13,718 INFO L93 Difference]: Finished difference Result 1897 states and 2822 transitions. [2024-11-22 19:05:13,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:13,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-22 19:05:13,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:13,723 INFO L225 Difference]: With dead ends: 1897 [2024-11-22 19:05:13,723 INFO L226 Difference]: Without dead ends: 1897 [2024-11-22 19:05:13,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:13,724 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 44 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:13,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 150 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:13,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2024-11-22 19:05:13,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1894. [2024-11-22 19:05:13,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1894 states, 1893 states have (on average 1.4896988906497624) internal successors, (2820), 1893 states have internal predecessors, (2820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1894 states to 1894 states and 2820 transitions. [2024-11-22 19:05:13,752 INFO L78 Accepts]: Start accepts. Automaton has 1894 states and 2820 transitions. Word has length 23 [2024-11-22 19:05:13,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:13,752 INFO L471 AbstractCegarLoop]: Abstraction has 1894 states and 2820 transitions. [2024-11-22 19:05:13,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1894 states and 2820 transitions. [2024-11-22 19:05:13,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-22 19:05:13,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:13,754 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:13,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-22 19:05:13,754 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:13,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:13,755 INFO L85 PathProgramCache]: Analyzing trace with hash 948099177, now seen corresponding path program 1 times [2024-11-22 19:05:13,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:13,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409614288] [2024-11-22 19:05:13,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:13,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:13,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:13,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:13,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409614288] [2024-11-22 19:05:13,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409614288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:13,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:13,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:13,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423808118] [2024-11-22 19:05:13,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:13,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:13,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:13,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:13,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:13,806 INFO L87 Difference]: Start difference. First operand 1894 states and 2820 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:13,821 INFO L93 Difference]: Finished difference Result 1929 states and 2822 transitions. [2024-11-22 19:05:13,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:13,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-22 19:05:13,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:13,826 INFO L225 Difference]: With dead ends: 1929 [2024-11-22 19:05:13,826 INFO L226 Difference]: Without dead ends: 1929 [2024-11-22 19:05:13,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:13,827 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 46 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:13,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 143 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:13,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1929 states. [2024-11-22 19:05:13,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1929 to 1926. [2024-11-22 19:05:13,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1926 states, 1925 states have (on average 1.464935064935065) internal successors, (2820), 1925 states have internal predecessors, (2820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 2820 transitions. [2024-11-22 19:05:13,860 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 2820 transitions. Word has length 24 [2024-11-22 19:05:13,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:13,860 INFO L471 AbstractCegarLoop]: Abstraction has 1926 states and 2820 transitions. [2024-11-22 19:05:13,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 2820 transitions. [2024-11-22 19:05:13,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-22 19:05:13,862 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:13,863 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:13,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-22 19:05:13,863 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:13,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:13,864 INFO L85 PathProgramCache]: Analyzing trace with hash -331764501, now seen corresponding path program 1 times [2024-11-22 19:05:13,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:13,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833321465] [2024-11-22 19:05:13,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:13,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:13,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:13,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:13,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833321465] [2024-11-22 19:05:13,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833321465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:13,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:13,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:13,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724437921] [2024-11-22 19:05:13,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:13,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:13,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:13,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:13,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:13,884 INFO L87 Difference]: Start difference. First operand 1926 states and 2820 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:13,903 INFO L93 Difference]: Finished difference Result 3337 states and 4902 transitions. [2024-11-22 19:05:13,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:13,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-22 19:05:13,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:13,911 INFO L225 Difference]: With dead ends: 3337 [2024-11-22 19:05:13,911 INFO L226 Difference]: Without dead ends: 3337 [2024-11-22 19:05:13,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:13,913 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 31 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:13,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 118 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:13,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3337 states. [2024-11-22 19:05:13,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3337 to 2822. [2024-11-22 19:05:13,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2822 states, 2821 states have (on average 1.4193548387096775) internal successors, (4004), 2821 states have internal predecessors, (4004), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2822 states to 2822 states and 4004 transitions. [2024-11-22 19:05:13,971 INFO L78 Accepts]: Start accepts. Automaton has 2822 states and 4004 transitions. Word has length 24 [2024-11-22 19:05:13,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:13,971 INFO L471 AbstractCegarLoop]: Abstraction has 2822 states and 4004 transitions. [2024-11-22 19:05:13,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:13,971 INFO L276 IsEmpty]: Start isEmpty. Operand 2822 states and 4004 transitions. [2024-11-22 19:05:13,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-22 19:05:13,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:13,977 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:13,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-22 19:05:13,977 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:13,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:13,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1342881751, now seen corresponding path program 1 times [2024-11-22 19:05:13,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:13,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819520150] [2024-11-22 19:05:13,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:13,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:13,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:14,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:14,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:14,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819520150] [2024-11-22 19:05:14,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819520150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:14,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:14,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:14,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702599342] [2024-11-22 19:05:14,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:14,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:14,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:14,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:14,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:14,009 INFO L87 Difference]: Start difference. First operand 2822 states and 4004 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:14,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:14,037 INFO L93 Difference]: Finished difference Result 3721 states and 5190 transitions. [2024-11-22 19:05:14,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:14,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-22 19:05:14,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:14,045 INFO L225 Difference]: With dead ends: 3721 [2024-11-22 19:05:14,045 INFO L226 Difference]: Without dead ends: 3721 [2024-11-22 19:05:14,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:14,045 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 43 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:14,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 151 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:14,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3721 states. [2024-11-22 19:05:14,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3721 to 3718. [2024-11-22 19:05:14,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3718 states, 3717 states have (on average 1.3957492601560397) internal successors, (5188), 3717 states have internal predecessors, (5188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:14,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3718 states to 3718 states and 5188 transitions. [2024-11-22 19:05:14,098 INFO L78 Accepts]: Start accepts. Automaton has 3718 states and 5188 transitions. Word has length 24 [2024-11-22 19:05:14,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:14,099 INFO L471 AbstractCegarLoop]: Abstraction has 3718 states and 5188 transitions. [2024-11-22 19:05:14,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:14,099 INFO L276 IsEmpty]: Start isEmpty. Operand 3718 states and 5188 transitions. [2024-11-22 19:05:14,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-22 19:05:14,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:14,102 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:14,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-22 19:05:14,102 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:14,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:14,103 INFO L85 PathProgramCache]: Analyzing trace with hash -1688093515, now seen corresponding path program 1 times [2024-11-22 19:05:14,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:14,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132207132] [2024-11-22 19:05:14,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:14,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:14,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:14,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:14,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132207132] [2024-11-22 19:05:14,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132207132] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:14,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:14,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:14,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858984106] [2024-11-22 19:05:14,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:14,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:14,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:14,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:14,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:14,119 INFO L87 Difference]: Start difference. First operand 3718 states and 5188 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:14,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:14,135 INFO L93 Difference]: Finished difference Result 3785 states and 5190 transitions. [2024-11-22 19:05:14,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:14,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-22 19:05:14,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:14,144 INFO L225 Difference]: With dead ends: 3785 [2024-11-22 19:05:14,144 INFO L226 Difference]: Without dead ends: 3785 [2024-11-22 19:05:14,144 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:14,179 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 45 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:14,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 139 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:14,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3785 states. [2024-11-22 19:05:14,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3785 to 3782. [2024-11-22 19:05:14,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3782 states, 3781 states have (on average 1.37212377677863) internal successors, (5188), 3781 states have internal predecessors, (5188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:14,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3782 states to 3782 states and 5188 transitions. [2024-11-22 19:05:14,241 INFO L78 Accepts]: Start accepts. Automaton has 3782 states and 5188 transitions. Word has length 25 [2024-11-22 19:05:14,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:14,242 INFO L471 AbstractCegarLoop]: Abstraction has 3782 states and 5188 transitions. [2024-11-22 19:05:14,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:14,242 INFO L276 IsEmpty]: Start isEmpty. Operand 3782 states and 5188 transitions. [2024-11-22 19:05:14,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-22 19:05:14,247 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:14,247 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:14,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-22 19:05:14,248 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:14,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:14,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1327010103, now seen corresponding path program 1 times [2024-11-22 19:05:14,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:14,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047739703] [2024-11-22 19:05:14,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:14,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:14,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:14,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:14,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:14,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047739703] [2024-11-22 19:05:14,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047739703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:14,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:14,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:14,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031177439] [2024-11-22 19:05:14,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:14,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:14,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:14,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:14,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:14,268 INFO L87 Difference]: Start difference. First operand 3782 states and 5188 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:14,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:14,297 INFO L93 Difference]: Finished difference Result 6409 states and 8774 transitions. [2024-11-22 19:05:14,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:14,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-22 19:05:14,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:14,319 INFO L225 Difference]: With dead ends: 6409 [2024-11-22 19:05:14,322 INFO L226 Difference]: Without dead ends: 6409 [2024-11-22 19:05:14,322 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:14,323 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 28 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:14,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 116 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:14,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6409 states. [2024-11-22 19:05:14,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6409 to 5638. [2024-11-22 19:05:14,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5638 states, 5637 states have (on average 1.329075749512152) internal successors, (7492), 5637 states have internal predecessors, (7492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:14,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5638 states to 5638 states and 7492 transitions. [2024-11-22 19:05:14,436 INFO L78 Accepts]: Start accepts. Automaton has 5638 states and 7492 transitions. Word has length 25 [2024-11-22 19:05:14,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:14,437 INFO L471 AbstractCegarLoop]: Abstraction has 5638 states and 7492 transitions. [2024-11-22 19:05:14,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:14,437 INFO L276 IsEmpty]: Start isEmpty. Operand 5638 states and 7492 transitions. [2024-11-22 19:05:14,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-22 19:05:14,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:14,442 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:14,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-22 19:05:14,442 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:14,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:14,443 INFO L85 PathProgramCache]: Analyzing trace with hash 315892853, now seen corresponding path program 1 times [2024-11-22 19:05:14,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:14,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648930341] [2024-11-22 19:05:14,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:14,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:14,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:14,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:14,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648930341] [2024-11-22 19:05:14,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648930341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:14,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:14,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:14,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93829749] [2024-11-22 19:05:14,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:14,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:14,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:14,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:14,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:14,461 INFO L87 Difference]: Start difference. First operand 5638 states and 7492 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:14,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:14,485 INFO L93 Difference]: Finished difference Result 7305 states and 9478 transitions. [2024-11-22 19:05:14,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:14,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-11-22 19:05:14,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:14,505 INFO L225 Difference]: With dead ends: 7305 [2024-11-22 19:05:14,505 INFO L226 Difference]: Without dead ends: 7305 [2024-11-22 19:05:14,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:14,506 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 42 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:14,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 152 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:14,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7305 states. [2024-11-22 19:05:14,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7305 to 7302. [2024-11-22 19:05:14,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7302 states, 7301 states have (on average 1.297904396657992) internal successors, (9476), 7301 states have internal predecessors, (9476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:14,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7302 states to 7302 states and 9476 transitions. [2024-11-22 19:05:14,581 INFO L78 Accepts]: Start accepts. Automaton has 7302 states and 9476 transitions. Word has length 25 [2024-11-22 19:05:14,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:14,582 INFO L471 AbstractCegarLoop]: Abstraction has 7302 states and 9476 transitions. [2024-11-22 19:05:14,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:14,582 INFO L276 IsEmpty]: Start isEmpty. Operand 7302 states and 9476 transitions. [2024-11-22 19:05:14,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-22 19:05:14,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:14,587 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:14,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-22 19:05:14,588 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:14,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:14,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1805677772, now seen corresponding path program 1 times [2024-11-22 19:05:14,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:14,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014802780] [2024-11-22 19:05:14,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:14,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:14,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:14,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:14,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:14,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014802780] [2024-11-22 19:05:14,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014802780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:14,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:14,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:14,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857776045] [2024-11-22 19:05:14,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:14,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:14,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:14,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:14,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:14,611 INFO L87 Difference]: Start difference. First operand 7302 states and 9476 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:14,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:14,649 INFO L93 Difference]: Finished difference Result 7433 states and 9478 transitions. [2024-11-22 19:05:14,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:14,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-22 19:05:14,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:14,663 INFO L225 Difference]: With dead ends: 7433 [2024-11-22 19:05:14,664 INFO L226 Difference]: Without dead ends: 7433 [2024-11-22 19:05:14,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:14,664 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 44 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:14,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 135 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:14,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7433 states. [2024-11-22 19:05:14,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7433 to 7430. [2024-11-22 19:05:14,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7430 states, 7429 states have (on average 1.2755417956656347) internal successors, (9476), 7429 states have internal predecessors, (9476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:14,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7430 states to 7430 states and 9476 transitions. [2024-11-22 19:05:14,733 INFO L78 Accepts]: Start accepts. Automaton has 7430 states and 9476 transitions. Word has length 26 [2024-11-22 19:05:14,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:14,733 INFO L471 AbstractCegarLoop]: Abstraction has 7430 states and 9476 transitions. [2024-11-22 19:05:14,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:14,734 INFO L276 IsEmpty]: Start isEmpty. Operand 7430 states and 9476 transitions. [2024-11-22 19:05:14,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-22 19:05:14,739 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:14,739 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:14,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-22 19:05:14,739 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:14,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:14,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1209425846, now seen corresponding path program 1 times [2024-11-22 19:05:14,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:14,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51300900] [2024-11-22 19:05:14,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:14,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:14,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:14,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:14,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51300900] [2024-11-22 19:05:14,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51300900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:14,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:14,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:14,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119319328] [2024-11-22 19:05:14,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:14,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:14,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:14,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:14,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:14,760 INFO L87 Difference]: Start difference. First operand 7430 states and 9476 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:14,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:14,784 INFO L93 Difference]: Finished difference Result 12297 states and 15494 transitions. [2024-11-22 19:05:14,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:14,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-22 19:05:14,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:14,800 INFO L225 Difference]: With dead ends: 12297 [2024-11-22 19:05:14,801 INFO L226 Difference]: Without dead ends: 12297 [2024-11-22 19:05:14,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:14,801 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 25 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:14,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 114 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:14,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12297 states. [2024-11-22 19:05:14,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12297 to 11270. [2024-11-22 19:05:14,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11270 states, 11269 states have (on average 1.2384417428343242) internal successors, (13956), 11269 states have internal predecessors, (13956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:15,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11270 states to 11270 states and 13956 transitions. [2024-11-22 19:05:15,009 INFO L78 Accepts]: Start accepts. Automaton has 11270 states and 13956 transitions. Word has length 26 [2024-11-22 19:05:15,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:15,009 INFO L471 AbstractCegarLoop]: Abstraction has 11270 states and 13956 transitions. [2024-11-22 19:05:15,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:15,009 INFO L276 IsEmpty]: Start isEmpty. Operand 11270 states and 13956 transitions. [2024-11-22 19:05:15,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-22 19:05:15,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:15,017 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:15,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-22 19:05:15,018 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:15,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:15,018 INFO L85 PathProgramCache]: Analyzing trace with hash 198308596, now seen corresponding path program 1 times [2024-11-22 19:05:15,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:15,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357812652] [2024-11-22 19:05:15,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:15,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:15,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:15,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:15,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:15,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357812652] [2024-11-22 19:05:15,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357812652] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:15,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:15,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:15,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740740651] [2024-11-22 19:05:15,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:15,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:15,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:15,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:15,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:15,034 INFO L87 Difference]: Start difference. First operand 11270 states and 13956 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:15,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:15,061 INFO L93 Difference]: Finished difference Result 14345 states and 17158 transitions. [2024-11-22 19:05:15,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:15,061 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-22 19:05:15,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:15,079 INFO L225 Difference]: With dead ends: 14345 [2024-11-22 19:05:15,080 INFO L226 Difference]: Without dead ends: 14345 [2024-11-22 19:05:15,080 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:15,080 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 41 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:15,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 153 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:15,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14345 states. [2024-11-22 19:05:15,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14345 to 14342. [2024-11-22 19:05:15,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14342 states, 14341 states have (on average 1.1962903563210376) internal successors, (17156), 14341 states have internal predecessors, (17156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:15,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14342 states to 14342 states and 17156 transitions. [2024-11-22 19:05:15,218 INFO L78 Accepts]: Start accepts. Automaton has 14342 states and 17156 transitions. Word has length 26 [2024-11-22 19:05:15,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:15,218 INFO L471 AbstractCegarLoop]: Abstraction has 14342 states and 17156 transitions. [2024-11-22 19:05:15,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:15,219 INFO L276 IsEmpty]: Start isEmpty. Operand 14342 states and 17156 transitions. [2024-11-22 19:05:15,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 19:05:15,229 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:15,229 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:15,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-22 19:05:15,230 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:15,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:15,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1155811872, now seen corresponding path program 1 times [2024-11-22 19:05:15,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:15,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892532105] [2024-11-22 19:05:15,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:15,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:15,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:15,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:15,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892532105] [2024-11-22 19:05:15,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892532105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:15,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:15,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:15,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701340273] [2024-11-22 19:05:15,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:15,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:15,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:15,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:15,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:15,246 INFO L87 Difference]: Start difference. First operand 14342 states and 17156 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:15,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:15,338 INFO L93 Difference]: Finished difference Result 14601 states and 17158 transitions. [2024-11-22 19:05:15,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:15,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-22 19:05:15,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:15,357 INFO L225 Difference]: With dead ends: 14601 [2024-11-22 19:05:15,357 INFO L226 Difference]: Without dead ends: 14601 [2024-11-22 19:05:15,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:15,358 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 43 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:15,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 131 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 19:05:15,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14601 states. [2024-11-22 19:05:15,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14601 to 14598. [2024-11-22 19:05:15,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14598 states, 14597 states have (on average 1.175309995204494) internal successors, (17156), 14597 states have internal predecessors, (17156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:15,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14598 states to 14598 states and 17156 transitions. [2024-11-22 19:05:15,571 INFO L78 Accepts]: Start accepts. Automaton has 14598 states and 17156 transitions. Word has length 27 [2024-11-22 19:05:15,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:15,571 INFO L471 AbstractCegarLoop]: Abstraction has 14598 states and 17156 transitions. [2024-11-22 19:05:15,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:15,571 INFO L276 IsEmpty]: Start isEmpty. Operand 14598 states and 17156 transitions. [2024-11-22 19:05:15,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 19:05:15,582 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:15,582 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:15,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-22 19:05:15,583 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:15,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:15,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1859291746, now seen corresponding path program 1 times [2024-11-22 19:05:15,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:15,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587899795] [2024-11-22 19:05:15,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:15,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:15,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:15,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:15,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587899795] [2024-11-22 19:05:15,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587899795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:15,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:15,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:15,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604056404] [2024-11-22 19:05:15,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:15,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:15,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:15,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:15,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:15,602 INFO L87 Difference]: Start difference. First operand 14598 states and 17156 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:15,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:15,652 INFO L93 Difference]: Finished difference Result 23558 states and 26884 transitions. [2024-11-22 19:05:15,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:15,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-22 19:05:15,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:15,685 INFO L225 Difference]: With dead ends: 23558 [2024-11-22 19:05:15,685 INFO L226 Difference]: Without dead ends: 23558 [2024-11-22 19:05:15,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:15,686 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 20 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:15,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 110 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:15,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23558 states. [2024-11-22 19:05:15,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23558 to 22534. [2024-11-22 19:05:15,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22534 states, 22533 states have (on average 1.1476501131673547) internal successors, (25860), 22533 states have internal predecessors, (25860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:15,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22534 states to 22534 states and 25860 transitions. [2024-11-22 19:05:15,967 INFO L78 Accepts]: Start accepts. Automaton has 22534 states and 25860 transitions. Word has length 27 [2024-11-22 19:05:15,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:15,967 INFO L471 AbstractCegarLoop]: Abstraction has 22534 states and 25860 transitions. [2024-11-22 19:05:15,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:15,967 INFO L276 IsEmpty]: Start isEmpty. Operand 22534 states and 25860 transitions. [2024-11-22 19:05:15,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-22 19:05:15,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 19:05:15,989 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:15,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-22 19:05:15,990 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2024-11-22 19:05:15,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 19:05:15,990 INFO L85 PathProgramCache]: Analyzing trace with hash 848174496, now seen corresponding path program 1 times [2024-11-22 19:05:15,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 19:05:15,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613824162] [2024-11-22 19:05:15,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 19:05:15,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 19:05:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 19:05:16,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 19:05:16,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 19:05:16,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613824162] [2024-11-22 19:05:16,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613824162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 19:05:16,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 19:05:16,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 19:05:16,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564685704] [2024-11-22 19:05:16,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 19:05:16,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 19:05:16,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 19:05:16,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 19:05:16,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:16,010 INFO L87 Difference]: Start difference. First operand 22534 states and 25860 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:16,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 19:05:16,135 INFO L93 Difference]: Finished difference Result 28163 states and 30722 transitions. [2024-11-22 19:05:16,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 19:05:16,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-22 19:05:16,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 19:05:16,136 INFO L225 Difference]: With dead ends: 28163 [2024-11-22 19:05:16,136 INFO L226 Difference]: Without dead ends: 0 [2024-11-22 19:05:16,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 19:05:16,137 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 38 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 19:05:16,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 150 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 19:05:16,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-22 19:05:16,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-22 19:05:16,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:16,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-22 19:05:16,138 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2024-11-22 19:05:16,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 19:05:16,138 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-22 19:05:16,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 19:05:16,138 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-22 19:05:16,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-22 19:05:16,140 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (1 of 2 remaining) [2024-11-22 19:05:16,141 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK (0 of 2 remaining) [2024-11-22 19:05:16,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-22 19:05:16,143 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 19:05:16,145 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 19:05:16,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 07:05:16 BoogieIcfgContainer [2024-11-22 19:05:16,147 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 19:05:16,148 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 19:05:16,148 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 19:05:16,148 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 19:05:16,148 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:05:12" (3/4) ... [2024-11-22 19:05:16,150 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-22 19:05:16,156 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-22 19:05:16,157 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-22 19:05:16,157 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-22 19:05:16,157 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-22 19:05:16,239 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 19:05:16,240 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-22 19:05:16,240 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 19:05:16,240 INFO L158 Benchmark]: Toolchain (without parser) took 4821.44ms. Allocated memory was 218.1MB in the beginning and 574.6MB in the end (delta: 356.5MB). Free memory was 150.0MB in the beginning and 378.5MB in the end (delta: -228.5MB). Peak memory consumption was 129.6MB. Max. memory is 16.1GB. [2024-11-22 19:05:16,240 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 113.2MB. Free memory is still 75.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 19:05:16,240 INFO L158 Benchmark]: CACSL2BoogieTranslator took 240.64ms. Allocated memory is still 218.1MB. Free memory was 149.8MB in the beginning and 136.9MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-22 19:05:16,241 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.81ms. Allocated memory is still 218.1MB. Free memory was 136.9MB in the beginning and 135.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 19:05:16,241 INFO L158 Benchmark]: Boogie Preprocessor took 28.51ms. Allocated memory is still 218.1MB. Free memory was 135.0MB in the beginning and 133.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 19:05:16,241 INFO L158 Benchmark]: RCFGBuilder took 393.10ms. Allocated memory is still 218.1MB. Free memory was 133.0MB in the beginning and 183.4MB in the end (delta: -50.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-22 19:05:16,241 INFO L158 Benchmark]: TraceAbstraction took 4034.58ms. Allocated memory was 218.1MB in the beginning and 574.6MB in the end (delta: 356.5MB). Free memory was 183.1MB in the beginning and 383.8MB in the end (delta: -200.7MB). Peak memory consumption was 159.0MB. Max. memory is 16.1GB. [2024-11-22 19:05:16,241 INFO L158 Benchmark]: Witness Printer took 92.18ms. Allocated memory is still 574.6MB. Free memory was 383.8MB in the beginning and 378.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 19:05:16,242 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 113.2MB. Free memory is still 75.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 240.64ms. Allocated memory is still 218.1MB. Free memory was 149.8MB in the beginning and 136.9MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.81ms. Allocated memory is still 218.1MB. Free memory was 136.9MB in the beginning and 135.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.51ms. Allocated memory is still 218.1MB. Free memory was 135.0MB in the beginning and 133.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 393.10ms. Allocated memory is still 218.1MB. Free memory was 133.0MB in the beginning and 183.4MB in the end (delta: -50.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4034.58ms. Allocated memory was 218.1MB in the beginning and 574.6MB in the end (delta: 356.5MB). Free memory was 183.1MB in the beginning and 383.8MB in the end (delta: -200.7MB). Peak memory consumption was 159.0MB. Max. memory is 16.1GB. * Witness Printer took 92.18ms. Allocated memory is still 574.6MB. Free memory was 383.8MB in the beginning and 378.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 3]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 43 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 30, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1234 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1234 mSDsluCounter, 4036 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1556 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 150 IncrementalHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 2480 mSDtfsCounter, 150 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22534occurred in iteration=29, InterpolantAutomatonStates: 89, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 30 MinimizatonAttempts, 4150 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 647 NumberOfCodeBlocks, 647 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 617 ConstructedInterpolants, 0 QuantifiedInterpolants, 1285 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-22 19:05:16,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE